Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
maximum flow algorithm |
| gptkbp:alsoKnownAs |
gptkb:Dinitz's_algorithm
gptkb:Dinitz_algorithm |
| gptkbp:author |
gptkb:Yefim_Dinitz
|
| gptkbp:complexity |
O(E sqrt(V)) for unit capacity graphs
O(V^2 E) |
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Dinic's algorithm
|
| gptkbp:input |
flow network
|
| gptkbp:introducedIn |
1970
|
| gptkbp:namedAfter |
gptkb:Yefim_Dinitz
|
| gptkbp:output |
maximum flow
|
| gptkbp:relatedTo |
gptkb:Edmonds-Karp_algorithm
gptkb:Ford-Fulkerson_algorithm gptkb:Push-relabel_algorithm |
| gptkbp:solvedBy |
maximum flow problem
|
| gptkbp:uses |
blocking flow
level graph |
| gptkbp:bfsParent |
gptkb:Edmonds–Karp_algorithm
|
| gptkbp:bfsLayer |
5
|