Statements (50)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
gptkb:Logistics
Telecommunications Supply chain management Traffic engineering Project scheduling |
| gptkbp:field |
gptkb:Mathematics
Computer science Operations research |
| gptkbp:hasProperty |
Capacity
Directed graph Feasibility Flow conservation Optimality Sink node Source node |
| https://www.w3.org/2000/01/rdf-schema#label |
Network Flow
|
| gptkbp:notableFor |
gptkb:Push-relabel_algorithm
gptkb:Dinic's_algorithm Capacity scaling algorithm Cycle-canceling algorithm Successive shortest path algorithm |
| gptkbp:relatedTo |
gptkb:Edmonds-Karp_algorithm
gptkb:Ford-Fulkerson_algorithm gptkb:Graph_theory Optimization Max-flow min-cut theorem Minimum-cost flow problem Multi-commodity flow problem Transportation problem |
| gptkbp:solvedBy |
Linear programming
Combinatorial algorithms |
| gptkbp:usedIn |
Internet routing
Resource allocation Image segmentation Network design Airline scheduling Assignment problem Bipartite graphs Data flow analysis Electric power grids Evacuation planning Financial networks Matching problem Network reliability Pipeline optimization Sports tournament scheduling Water distribution networks |
| gptkbp:bfsParent |
gptkb:Graph_Algorithms
|
| gptkbp:bfsLayer |
6
|