Maintaining information in fully dynamic trees with top trees
From MaRDI portal
Publication:2944498
DOI10.1145/1103963.1103966zbMath1321.68211MaRDI 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
Determinant-Preserving Sparsification of SDDM Matrices, Faster Approximate Diameter and Distance Oracles in Planar Graphs, An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner, Unnamed Item, Maximizing dominance in the plane and its applications, Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay, Categorified Reeb graphs, Maintaining centdians in a fully dynamic forest with top trees, LS(graph): a constraint-based local search for constraint optimization on trees and paths, Finding the conditional location of a median path on a tree, Maintaining dynamic minimum spanning trees: an experimental study, Dynamic mechanism design, Extensive facility location problems on networks: an updated review, Dynamic planar embeddings of dynamic graphs, The nearest colored node in a tree, An improved algorithm for computing all the best swap edges of a tree spanner, Faster approximate diameter and distance oracles in planar graphs, Top tree compression of tries, Multiple-edge-fault-tolerant approximate shortest-path trees, Efficient algorithms for the minmax regret path center problem with length constraint on trees, An improved algorithm for the minmax regret path center problem on trees, Compressed range minimum queries, Tree compression with top trees, A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph, Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs, Faster Fully-Dynamic Minimum Spanning Forest, A Faster Computation of All the Best Swap Edges of a Tree Spanner
