Even–Tarjan network flow algorithm
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:author |
gptkb:Robert_Tarjan
gptkb:Shimon_Even |
| gptkbp:complexity |
O(n^2 log n)
|
| gptkbp:field |
computer science
graph theory network flow |
| gptkbp:introducedIn |
1975
|
| gptkbp:namedAfter |
gptkb:Robert_Tarjan
gptkb:Shimon_Even |
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Ford–Fulkerson_algorithm
gptkb:Push–relabel_algorithm gptkb:Edmonds–Karp_algorithm |
| gptkbp:solvedBy |
maximum flow problem
|
| gptkbp:uses |
dynamic trees
|
| gptkbp:bfsParent |
gptkb:Shimon_Even
|
| gptkbp:bfsLayer |
5
|
| http://www.w3.org/2000/01/rdf-schema#label |
Even–Tarjan network flow algorithm
|