Paperback (28 Mar 2003)
Save $4.21
Includes delivery to the United States
10+ copies available online - Usually dispatched within 7 days
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.
| ISBN: | 9780486414539 |
| Publisher: | Dover Publications Inc. |
| Imprint: | Dover Publications |
| Pub date: | 28 Mar 2003 |
| DEWEY: | 519.3 |
| DEWEY edition: | 21 |
| Language: | English |
| Number of pages: | 374 |
| Weight: | 386g |
| Height: | 222mm |
| Width: | 127mm |
| Spine width: | 25mm |
$9.57off
Paperback
Published 16 Sep 1976
Save $9.57
