Algorithmresearch
Ladder decomposition
Also called ladder algorithm, long-path decomposition.
Answer level ancestor queries in O(1) after linear preprocessing.
Answer level ancestor queries in O(1) after linear preprocessing.
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 VJP1A9 Edit this page History Report an error