Combinatorial Optimization : Networks and Matroids

Combinatorial Optimization : Networks and Matroids
Combinatorial Optimization : Networks and Matroids
(1) 1 shops 0 products

Detailed product description

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.

Dover Books on Mathematics: Combinatorial Optimization: Networks and Matroids (Paperback)

Compare buying offers

Search
Amazon Amazon
Currently Unavailable - Out of Stock

We don't know when or if this item will be back in stock. Please check back later for updates.

Product specifications

Technical details

Manufacturer -
Brand Eugene S Lawler; Mathematics
Item model number -
Color -
Weight -
Height -
Depth -

Additional product information

Product Id 533076
User Reviews and Ratings 3 (1 ratings) 3 out of 5 stars
UPC 800759414536

Compare buying offers

# Title Reviews User Ratings Price
1
Search on Amazon
Price:
Search on Amazon
Search on Amazon

Similar Products View All

arrow_upward