Lower-Stretch Spanning Trees

Details Lower-Stretch Spanning Trees Lower-Stretch Spanning Trees

2004-11-17

arxiv.org/abs/cs/0411064v5

Computer Science

Data Structures and Algorithms

Scientific paper

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 log^2 n).

Affiliated with

Also associated with

No associations

Rating

Lower-Stretch Spanning Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower-Stretch Spanning Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower-Stretch Spanning Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257924