Computing Best Swaps in Optimal Tree Spanners

DOI10.1007/978-3-540-92182-0_63MaRDI QIDQ3596764zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Computing all best swaps for minimum-stretch tree spanners
• A Faster Computation of All the Best Swap Edges of a Tree Spanner
• An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
• An improved algorithm for computing all the best swap edges of a tree spanner
• scientific article; zbMATH DE number 2163017
• A faster computation of all the best swap edges of a shortest paths tree
• A faster computation of all the best swap edges of a shortest paths tree
• A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
• Faster Swap Edge Computation in Minimum Diameter Spanning Trees
• Faster swap edge computation in minimum diameter spanning trees

Cited in

(7)

• An improved algorithm for computing all the best swap edges of a tree spanner
• Finding best swap edges minimizing the routing cost of a spanning tree
• A Faster Computation of All the Best Swap Edges of a Tree Spanner
• Finding best swap edges minimizing the routing cost of a spanning tree
• An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
• Principles of Distributed Systems
• Computing all best swaps for minimum-stretch tree spanners

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

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