What people are saying - Write a review
User Review - Flag as inappropriate
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
25 other sections not shown
Other editions - View all
adjacency list algorithm performs Application arc costs arc flows arc i,j arc lengths augmenting path algorithm bipartite capacity scaling algorithm commodity constraints cost flow problem define denote Dijkstra's algorithm directed cycle directed network directed path discussion distance label example Exercise feasible flow feasible solution Fibonacci heap flow algorithms formulation implementation integer iteration label-correcting algorithm Lagrangian multiplier Lagrangian relaxation Lemma linear programming lower bound matching matrix maximum flow problem minimum cost flow minimum spanning tree multicommodity flow problem negative cycle network contains network flow problem network G network simplex algorithm node potentials nonnegative objective function value operation optimal solution optimality conditions path from node polynomial preflow-push algorithm reduced cost residual network s-t cut satisfies scaling phase Section shortest path distances shortest path problem Show shown in Figure simplex method sink node source node Suppose Theorem undirected units of flow upper bound variables zero
From Google Scholar
MEJ Newman - 2003 - Arxiv preprint cond-mat/0303516
2001 - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
MEJ Newman, M Girvan
All Scholar search results »
S Boccaletti, V Latora, Y Moreno, M Chavez, D-U Hwang - 2006 - Physics Reports
INFORMS Online Bookstore
JSTOR: Network Flows: Theory, Algorithms, and Applications.
Pearson - Network Flows: Theory, Algorithms, and Applications
Ravindra K. Ahuja
Books: NETWORK FLOWS: lr Ford, dr Fulkerson, Flows in Networks ...
4 Maximum flow problem (A. Bockmayr) 4.1 Network flows 4.2 Maximum ...
Flow network - Wikipedia, the free encyclopedia
SYLLABUS IE 8753 NETWORK FLOWS AND DYNAMIC PROGRAMMING INSTRUCTOR ...