News for hackers. Stuff that matters.
Re:The Unreasonable Effectiveness of Spectral Graph Theory: ... by espeed on Monday November 16, 2015 @12:11PM (#10575584)
"Using Petal-Decompositions to Build a Low Stretch Spanning Tree" (http://research.microsoft.com/pubs/163400/spanning-full1.pdf):

  Stretch: O(log n log log n)
  Time:    O(m log n log log n)

There are no comments on this comment yet.