Pages that link to "Item:Q2944498"
From MaRDI portal
The following pages link to Maintaining information in fully dynamic trees with top trees (Q2944498):
Displaying 27 items.
- Categorified Reeb graphs (Q309649) (← links)
- Maintaining centdians in a fully dynamic forest with top trees (Q479062) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Dynamic mechanism design (Q1014626) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Tree compression with top trees (Q2347804) (← links)
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph (Q2391712) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- (Q5874462) (← links)
- Maximizing dominance in the plane and its applications (Q5925538) (← links)
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay (Q6124426) (← links)
