Abraham, Ittai; Neiman, Ofer Using petal-decompositions to build a low stretch spanning tree. (English) Zbl 1286.05028 Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 395-406 (2012). Cited in 16 Documents MSC: 05C05 Trees 05C85 Graph algorithms (graph-theoretic aspects) 68R10 Graph theory (including graph drawing) in computer science Keywords:distortion; embedding; low stretch spanning tree; metric spaces PDFBibTeX XMLCite \textit{I. Abraham} and \textit{O. Neiman}, in: Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19--22, 2012. New York, NY: Association for Computing Machinery (ACM). 395--406 (2012; Zbl 1286.05028) Full Text: DOI Link