Fully-adaptive dynamic connectivity of square intersection graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2079390 (Why is no real title available?)
- A class of algorithms which require nonlinear time to maintain disjoint sets
- A data structure for dynamic trees
- Adding range restriction capability to dynamic data structures
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- Computational geometry. Algorithms and applications.
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Decremental Dynamic Connectivity
- Dynamic connectivity in disk graphs
- Dynamic connectivity: connecting to networks and geometry
- Dynamic graph connectivity in polylogarithmic worst case time
- Dynamic minimum spanning forest with subpolynomial worst-case update time
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Dynamic planar point location with sub-logarithmic local updates
- General Balanced Trees
- Good r-divisions imply optimal amortized decremental biconnectivity
- Marked ancestor problems
- Near-optimal fully-dynamic graph connectivity
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- Optimal decremental connectivity in planar graphs
- Optimal on-line decremental connectivity in trees
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Separator based sparsification for dynamic planar graph algorithms
- Worst-case Analysis of Set Union Algorithms
This page was built for publication: Fully-adaptive dynamic connectivity of square intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241070)
