Spanning trees with low maximum/average stretch

DOI10.1007/3-540-44849-7_6MaRDI QIDQ4437490zbMATH OpenFDO

Authors David Peleg

Publication date 2 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530006.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Recommendations

• Low stretch spanning trees
• Lower-stretch spanning trees
• Lower-Stretch Spanning Trees
• Spanning trees with low crossing number
• scientific article; zbMATH DE number 7759283
• Spanning Trees with Few Branch Vertices
• Spanning trees with minimum weighted degrees
• Spanning tree with lower bound on the degrees
• On spanning trees with few branch vertices
• Low-degree minimum spanning trees

Cited in

(4)

• Max-stretch reduction for tree spanners
• Lower-stretch spanning trees
• On minimum average stretch spanning trees in grid graphs
• Using petal-decompositions to build a low stretch spanning tree

This page was built for publication: Spanning trees with low maximum/average stretch

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437490)