Decremental Dynamic Connectivity
From MaRDI portal
Recommendations
Cited in
(9)- Incomplete directed perfect phylogeny in linear time
- Dynamic connectivity for axis-parallel rectangles
- Optimal decremental connectivity in planar graphs
- Optimal on-line decremental connectivity in trees
- An Optimal Rebuilding Strategy for a Decremental Tree Problem
- Randomization for efficient dynamic graph algorithms (invited talk)
- Decremental strongly connected components and single-source reachability in near-linear time
- Optimal decremental connectivity in planar graphs
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study
This page was built for publication: Decremental Dynamic Connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935307)