Skip to content
Vinony
Category

Network flow problem

page 1
Braess's paradox
proposed explanation for how trying to improve traffic flow actually has the reverse effect
Ford–Fulkerson algorithm
algorithm
flow network
directed graph where each edge has a capacity and each edge receives a flow
Max-flow min-cut theorem
theorem in optimization theory
maximum flow problem
computational problem in graph theory
Edmonds–Karp algorithm
algorithm
Dinic's algorithm
algorithm for computing the maximal flow of a network
minimum-cost flow problem
mathematical optimization problem
push–relabel maximum flow algorithm
algorithm
minimum cut
a cut of a graph that is minimal