About this book
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.
Product details
ISBN
9780486414539
Published
10 November 2011
Format
Paperback
Dimensions
209 × 136 mm
Publisher
DOVER
Imprint
Dover Publications
Audience
General Adult
Listed in
Genres
Link copied