Details
PUBLISHED
[United States] : Dover Publications : Made available through hoopla, 2012
DESCRIPTION
1 online resource
ISBN/ISSN
9780486143668 (electronic bk.) MWT11604555, 048614366X (electronic bk.) 11604555
LANGUAGE
English
NOTES
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics
Mode of access: World Wide Web