In the sale you will find especially cheap items or current promotions.
Want to part with books, CDs, movies or games? Sell everything on momox.com
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.