Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
Read More
Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
Read Less
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very Good. Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Exact ISBN match. Immediate shipping. No funny business. Pics available upon request. Sewn binding. Cloth over boards. 384 p. Contains: Illustrations.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very good. Text block firm and clean, binding unblemished, boards straight, no highlights or underlining. Well packaged and promptly shipped from California. Partnered with Friends of the Library since 2010.