Maintaining information in fully dynamic trees with top trees
From MaRDI portal
Recommendations
Cited in
(42)- 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
- Tree compression with top trees
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- scientific article; zbMATH DE number 1617247 (Why is no real title available?)
- Self-adjusting top trees
- Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
- Categorified Reeb graphs
- Faster Fully-Dynamic Minimum Spanning Forest
- A Faster Computation of All the Best Swap Edges of a Tree Spanner
- scientific article; zbMATH DE number 2151257 (Why is no real title available?)
- Maintaining centdians in a fully dynamic forest with top trees
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- Faster Approximate Diameter and Distance Oracles in Planar Graphs
- Determinant-preserving sparsification of SDDM matrices
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
- scientific article; zbMATH DE number 7651141 (Why is no real title available?)
- Maximizing dominance in the plane and its applications
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay
- Deterministic incremental APSP with polylogarithmic update time and stretch
- Incremental dead state detection in logarithmic time
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
- Minimum cut in \(O(m \log^2 n)\) time
- Near-optimal algorithm for constructing greedy consensus tree
- Minimum cut in O(m^2 n time
- Maintaining \(\mathrm{CMSO}_2\) properties on dynamic structures with bounded feedback vertex number
- Distance queries over dynamic interval graphs
- Finding diameter-reducing shortcuts in trees
- Temporal queries for dynamic temporal forests
- On maximal k-edge-connected subgraphs of undirected graphs
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Title not available (Why is no real title available?)
- Finding the conditional location of a median path on a tree
- Maintaining dynamic minimum spanning trees: an experimental study
This page was built for publication: Maintaining information in fully dynamic trees with top trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944498)
