Combinational Optimization: Networks and Matroids by Lawler Lawler (English) Pap
21,48 €
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.
Jetzt bei Ebay:
![Produktbild - Combinatorial Optimization: Networks and Matroids [Dover Books on Mathematics]](https://i.ebayimg.com/thumbs/images/g/VXcAAOSwAANY53fT/s-l140.jpg)
