Book Statistics
1
Views
0
Comments
0
Rating
Combinatorial Optimization
Description
Networks and Matroids by Eugene Lawler examines shortest paths, network flows, bipartite matching, non bipartite matching. More importantly there is an excellent introduction to matroid theory including matroids and the greedy algorithm, matroid intersections and matroid parity problems, some of these Lawler's own results.
Reader's Comments (0)
Login to CommentNo Comments Yet
Be the first to share your thoughts about this book!