Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)
Share:
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids....
Also Available in:
- Amazon
- Audible
- Barnes & Noble
- AbeBooks
- Kobo
More Details
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.
- Format:
- Pages: pages
- Publication:
- Publisher:
- Edition:Reprint
- Language:
- ISBN10:0486414531
- ISBN13:9780486414539
- kindle Asin:B00EYVP9M0
About Author
