Maintaining spanning trees of small diameter

DOI10.1007/PL00009225MaRDI QIDQ1273933zbMATH OpenOpenAlexFDO

Authors R. Ramaswami, Giuseppe F. Italiano

Publication date 22 June 1999

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009225

zbMATH Keywords

spanning treeoptical networks

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Recommendations

• Maintaining spanning trees of small diameter
• Faster Swap Edge Computation in Minimum Diameter Spanning Trees
• Faster swap edge computation in minimum diameter spanning trees
• scientific article; zbMATH DE number 1305082

Cited in

(9)

• An improved algorithm for computing all the best swap edges of a tree spanner
• The swap edges of a multiple-sources routing tree
• Minimizing diameters of dynamic trees
• A Faster Computation of All the Best Swap Edges of a Tree Spanner
• Maintaining spanning trees of small diameter
• Reconfiguration of spanning trees with degree constraints or diameter constraints
• 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
• A faster computation of all the best swap edges of a shortest paths tree

This page was built for publication: Maintaining spanning trees of small diameter

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