Unweighted Maximum Flow
Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, all edges have unit weight.
Parameters
- : number of vertices
- : number of edges
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table