Combinatorial Optimization: Networks and Matroids

Front Cover
Holt, Rinehart and Winston, 1976 - Mathematics - 374 pages
0 Reviews
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.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Chapter
1
Some Representative Optimization Problems
2
When is a Problem Solved?
4
Copyright

89 other sections not shown

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information