Statements (50)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
image segmentation
network routing transportation networks bipartite matching project selection airline scheduling circulation problem |
| gptkbp:complexity |
polynomial time
|
| gptkbp:definedIn |
flow network
|
| gptkbp:field |
computer science
operations research graph theory |
| gptkbp:firstDescribed |
gptkb:Lester_R._Ford_Jr.
gptkb:Delbert_Fulkerson 1956 |
| https://www.w3.org/2000/01/rdf-schema#label |
Maximum Flow Problem
|
| gptkbp:input |
graph
capacity on each edge |
| gptkbp:objective |
find maximum feasible flow from source to sink
|
| gptkbp:output |
flow assignment
maximum flow value |
| gptkbp:prohibits |
capacity constraint
flow conservation |
| gptkbp:relatedTo |
gptkb:network_simplex_algorithm
minimum cut problem augmenting path residual graph maximum bipartite matching multi-commodity flow problem minimum cost flow problem cut-set integrality theorem |
| gptkbp:supportsAlgorithm |
gptkb:Edmonds-Karp_algorithm
gptkb:Ford-Fulkerson_algorithm gptkb:Push-relabel_algorithm gptkb:Dinic's_algorithm |
| gptkbp:usedIn |
computer vision
logistics telecommunications resource allocation supply chain management data mining traffic engineering water distribution networks sports scheduling power grid optimization |
| gptkbp:bfsParent |
gptkb:Combinatorial_Optimization
gptkb:MFP |
| gptkbp:bfsLayer |
6
|