Problemadvanced
Online minimum spanning tree problem
Also called online MST.
Vertices or edges arrive online and the current spanning tree must be maintained with small cost.
Vertices or edges arrive online and the current spanning tree must be maintained with small cost.
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 N7Y4QP Edit this page History Report an error