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.
Reprint of the Holt, Rinehart and Winston, New York, 1975 edition.
|Availability||Usually ships in 24 to 48 hours|
|Dimensions||5 1/2 x 8 1/2|