Problemresearch
Decremental single-source shortest paths
Also called decremental SSSP.
Maintain shortest-path distances from a source under edge deletions only.
Maintain shortest-path distances from a source under edge deletions only.
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 CS86G1 Edit this page History Report an error