Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
image segmentation
transportation networks bipartite matching circulation problems |
| gptkbp:complexity |
P
|
| gptkbp:describedYear |
1955
|
| gptkbp:field |
computer science
operations research graph theory |
| gptkbp:firstDescribed |
F. S. Ross
T. E. Harris |
| gptkbp:generalizes |
maximum bipartite matching
multi-commodity flow problem |
| gptkbp:hasDualProblem |
minimum cut problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Maximum flow problem
|
| gptkbp:input |
graph
source node edge capacities sink node |
| gptkbp:output |
flow assignment
maximum flow value |
| gptkbp:relatedTo |
network flow
minimum cut problem |
| gptkbp:solvedBy |
gptkb:Edmonds-Karp_algorithm
gptkb:Ford-Fulkerson_algorithm gptkb:Push-relabel_algorithm |
| gptkbp:bfsParent |
gptkb:Push–relabel_algorithm
|
| gptkbp:bfsLayer |
6
|