Light spanners in bounded pathwidth graphs

DOI10.1007/978-3-642-32589-2_42MaRDI QIDQ2912746zbMATH OpenOpenAlexFDO

Authors Hao-Hsiang Hung, Michelangelo Grigni

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_42

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22) Paths and cycles (05C38)

Recommendations

• Light spanners
• Light spanners
• Near-optimal light spanners
• Near-optimal light spanners
• scientific article; zbMATH DE number 2119747

Cited in

(9)

• Bounded-degree light approximate shortest-path trees in doubling metrics
• scientific article; zbMATH DE number 1670877 (Why is no real title available?)
• scientific article; zbMATH DE number 2119747 (Why is no real title available?)
• Light spanners
• Exploration of graphs with excluded minors
• Light spanners for snowflake metrics
• Lightweight paths in graphs
• Light Euclidean Spanners with Steiner Points
• The greedy spanner is existentially optimal

This page was built for publication: Light spanners in bounded pathwidth graphs

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