Computing all best swaps for minimum-stretch tree spanners

DOI10.7155/JGAA.00208MaRDI QIDQ3075610zbMATH OpenOpenAlexFDO

Authors Shantanu Das, Beat Gfeller, Peter Widmayer

Publication date 16 February 2011

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00208

zbMATH Keywords

best swaptree spanner

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Computing Best Swaps in Optimal Tree Spanners
• 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
• 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

Cited in

(9)

• An improved algorithm for computing all the best swap edges of a tree spanner
• A Faster Computation of All the Best Swap Edges of a Tree Spanner
• A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
• Faster Swap Edge Computation in Minimum Diameter Spanning Trees
• Computing Best Swaps in Optimal Tree Spanners
• scientific article; zbMATH DE number 1305082 (Why is no real title available?)
• A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
• An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
• Principles of Distributed Systems

This page was built for publication: Computing all best swaps for minimum-stretch tree spanners

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