Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into Bookshare to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 1976
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9780486143668
- Related ISBNs:
- 9780486414539
- Publisher:
- Dover Publications
- Date of Addition:
- 05/15/18
- Copyrighted By:
- Eugene Lawler
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.