Maintaining spanning trees of small diameter
From MaRDI portal
Publication:1273933
DOI10.1007/PL00009225zbMath0915.68084OpenAlexW1963834353MaRDI QIDQ1273933
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
Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items (8)
A Faster Computation of All the Best Swap Edges of a Tree Spanner ⋮ Minimizing diameters of dynamic trees ⋮ Reconfiguration of spanning trees with degree constraints or diameter constraints ⋮ A faster computation of all the best swap edges of a shortest paths tree ⋮ An improved algorithm for computing all the best swap edges of a tree spanner ⋮ The swap edges of a multiple-sources routing tree ⋮ 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
This page was built for publication: Maintaining spanning trees of small diameter
