Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:author |
gptkb:Shimon_Even
gptkb:Yossi_Shiloach |
| gptkbp:complexity |
O(mn)
|
| gptkbp:designedFor |
undirected graphs
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Even–Shiloach algorithm
|
| gptkbp:namedAfter |
gptkb:Shimon_Even
gptkb:Yossi_Shiloach |
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
An on-line edge-deletion problem |
| gptkbp:solvedBy |
dynamic connectivity problem
dynamic shortest path problem |
| gptkbp:usedFor |
maintaining shortest paths in dynamic graphs
|
| gptkbp:yearProposed |
1981
|
| gptkbp:bfsParent |
gptkb:Shimon_Even
|
| gptkbp:bfsLayer |
5
|