Dynamic geometric connectivity in the plane with constant query time
From MaRDI portal
Cites work
- A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
- Almost tight upper bounds for vertical decompositions in four dimensions
- Decomposable searching problems I. Static-to-dynamic transformation
- Decremental Dynamic Connectivity
- Dynamic connectivity for axis-parallel rectangles
- Dynamic connectivity in disk graphs
- Dynamic connectivity: connecting to networks and geometry
- Dynamic Subgraph Connectivity with Geometric Applications
- Dynamically switching vertices in planar graphs
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
- Geometric separator theorems and applications
- Hopcroft's problem, log-star shaving, 2D fractional cascading, and decision trees
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 6876123 (Why is no real title available?)
- scientific article; zbMATH DE number 7788427 (Why is no real title available?)
- Insertion-only dynamic connectivity in general disk graphs
- Linear-space data structures for range mode query in arrays
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Popular conjectures imply strong lower bounds for dynamic problems
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Semi-Online Maintenance of Geometric Optima and Measures
- Separators in region intersection graphs
- Tight dynamic problem lower bounds from generalized BMM and OMv
This page was built for publication: Dynamic geometric connectivity in the plane with constant query time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895866)
