A tight upper bound on the probabilistic embedding of series-parallel graphs
From MaRDI portal
Publication:3581564
DOI10.1145/1109557.1109673zbMath1192.05156OpenAlexW4251171485MaRDI QIDQ3581564
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109673
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
\(k\)-outerplanar graphs, planar duality, and low stretch spanning trees ⋮ Using Petal-Decompositions to Build a Low Stretch Spanning Tree
This page was built for publication: A tight upper bound on the probabilistic embedding of series-parallel graphs
