Minimizing diameters of dynamic trees

DOI10.1007/3-540-63165-8_184zbMath1401.68240OpenAlexW1486260668MaRDI QIDQ4571959

Jacob Holm, Mikkel Thorup, Kristian de Lichtenberg, Stephen Alstrup

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_184

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Longest common extensions in trees ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay ⋮ Gapped indexing for consecutive occurrences ⋮ Succinct data structures for nearest colored node in a tree ⋮ Tight Bounds for Top Tree Compression ⋮ Compressed subsequence matching and packed tree coloring ⋮ Tree compression with top trees

Cites Work

• A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
• Maintaining spanning trees of small diameter
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications

This page was built for publication: Minimizing diameters of dynamic trees