No Access
MAXIMUM FLOWS IN NETWORKS
https://doi.org/10.1142/9781848161290_0003Cited by:0 (Source: Crossref)
Abstract:
The following sections are included:
FLOWS
s-t CUTS
MAXIMUM FLOW
FORD–FULKERSON ALGORITHM
Integrity Theorem
Irrational Arc Capacities
LAYERED NETS
A BLOCKING FLOW ALGORITHM
VARIANTS OF THE FORD–FULKERSON ALGORITHM
Edmonds–Karp Algorithm
Dinic Algorithm
Other Variations
KARZANOV ALGORITHM
FLOWS IN UNDIRECTED AND MIXED NETS
FLOWS IN NODE-AND-ARC CAPACITATED NETS
SUMMARY AND SUGGESTED READING
REFERENCES
