Computing Best Swaps in Optimal Tree Spanners

DOI10.1007/978-3-540-92182-0_63zbMath1183.90086OpenAlexW1828145824MaRDI QIDQ3596764

Shantanu Das, Beat Gfeller, Peter Widmayer

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/69268

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (1)

Finding best swap edges minimizing the routing cost of a spanning tree

This page was built for publication: Computing Best Swaps in Optimal Tree Spanners