Combinatorial Optimization
Networks and Matroids
PAYBACK Punkte
10 °P sammeln!
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.
Andere Kunden interessierten sich für
