Algorithmresearch
Even-Shiloach tree
Also called ES-tree, Even-Shiloach trees.
Maintains bounded-depth shortest-path distances under edge deletions.
Maintains bounded-depth shortest-path distances under edge deletions.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag VS2KBW Edit this page History Report an error