Pages that link to "Item:Q3020009"
From MaRDI portal
The following pages link to Dynamic Connectivity: Connecting to Networks and Geometry (Q3020009):
Displaying 14 items.
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- Mincut sensitivity data structures for the insertion of an edge (Q2165037) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Space-efficient fully dynamic DFS in undirected graphs (Q2312405) (← links)
- Simplified kinetic connectivity for rectangles and hypercubes (Q2768286) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- (Q5088951) (← links)
- (Q5092428) (← links)
- Fully Dynamic Connectivity Oracles under General Vertex Updates (Q5136280) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- (Q5743413) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)