Combinatorial Optimization

Combinatorial Optimization

Networks and Matroids

eBook - 2001
Rate this:
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.
Publisher: Mineola, N.Y. : Dover Publications, [2001]
Copyright Date: ©2001
ISBN: 9780486143668
9780486414539
Branch Call Number: 519.3 La
Description: 1 online resource (x, 374 pages) : illustrations
Additional Contributors: Freading (Firm)

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age

Add Age Suitability

There are no ages for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Browse by Call Number

Recommendations

Subject Headings

LibraryThing Series Information


  Loading...

Find it at CRRL

  Loading...
[]
[]
To Top