Using petal-decompositions to build a low stretch spanning tree

Ittai Abraham, Ofer Neiman

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

We prove that any weighted graph G = (V, E, w) with n points and m edges has a spanning tree T such that \sum \{ u,v\} \in E dT (u,v) = O(m log n log log n). Moreover, such a tree can w(u,v) be found in time O(m log n log log n). Our result is obtained using our new petal-decomposition approach which guarantees that the radius of each cluster in the tree is at most four times the radius of the induced subgraph of the cluster in the original graph.

Original languageEnglish
Pages (from-to)227-248
Number of pages22
JournalSIAM Journal on Computing
Volume48
Issue number2
DOIs
StatePublished - 1 Jan 2019

Keywords

  • Distortion
  • Embedding
  • Low stretch
  • Spanning tree

ASJC Scopus subject areas

  • Computer Science (all)
  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Using petal-decompositions to build a low stretch spanning tree'. Together they form a unique fingerprint.

Cite this