Lower-Stretch Spanning Trees
Abstract
We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)2). Moreover, we show how to construct such a tree in time O(m log2 n).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.