Description
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 and concrete computational complexity in departments of computer science and mathematics.

Author: Lawler

VAT: No

Minimum Order Quantity: 0

Delivery:  Usually ships in 28 days. Import title.    

All UK orders are POST FREE!

All prices shown include applicable taxes.