Problemresearch
Low-stretch spanning tree problem
Also called low-stretch tree.
Find a spanning tree where tree distances between endpoints of every edge are small on average.
Find a spanning tree where tree distances between endpoints of every edge are small on average.
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 BEFWMZ Edit this page History Report an error