Network flows: theory, algorithms, and applications
Prentice Hall, 1993 - Business & Economics - 846 pages
Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including a description of new and novel polynomial-time algorithms for these core models. For professionals working with network flows, optimization, and network programming.
60 pages matching bipartite in this book
Results 1-3 of 60
What people are saying - Write a review
Approachable, powerful text.
Review: Network Flows: Theory, Algorithms, and ApplicationsUser Review - Joecolelife - Goodreads
Dr.Tom and other authors have done a great job in writing this book. The book covers a lot of topics in Network Programming and a variety of algorithms are cited. A must buy for any serious student taking a course in Network Programming. Read full review
PATHS TREES AND CYCLES
ALGORITHM DESIGN AND ANALYSIS
25 other sections not shown