Maintaining information in fully dynamic trees with top trees
From MaRDI portal
Publication:2944498
DOI10.1145/1103963.1103966zbMath1321.68211OpenAlexW1990488650MaRDI QIDQ2944498
Stephen Alstrup, Mikkel Thorup, Jacob Holm, Kristian de Lichtenberg
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1103963.1103966
Related Items
Efficient algorithms for the minmax regret path center problem with length constraint on trees, Faster Fully-Dynamic Minimum Spanning Forest, Categorified Reeb graphs, A Faster Computation of All the Best Swap Edges of a Tree Spanner, A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph, Extensive facility location problems on networks: an updated review, Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay, Dynamic planar embeddings of dynamic graphs, An improved algorithm for the minmax regret path center problem on trees, Unnamed Item, The nearest colored node in a tree, Determinant-Preserving Sparsification of SDDM Matrices, Maintaining centdians in a fully dynamic forest with top trees, Finding the conditional location of a median path on a tree, LS(graph): a constraint-based local search for constraint optimization on trees and paths, An improved algorithm for computing all the best swap edges of a tree spanner, Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs, Faster approximate diameter and distance oracles in planar graphs, Maintaining dynamic minimum spanning trees: an experimental study, Compressed range minimum queries, Dynamic mechanism design, Maximizing dominance in the plane and its applications, Top tree compression of tries, Multiple-edge-fault-tolerant approximate shortest-path trees, Faster Approximate Diameter and Distance Oracles in Planar Graphs, Tree compression with top trees, An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
