Dynamic connectivity: connecting to networks and geometry

DOI10.1137/090751670zbMATH Open1225.68264DBLPjournals/siamcomp/ChanPR11arXiv0808.1128OpenAlexW2116060765WikidataQ60638798 ScholiaQ60638798MaRDI QIDQ3020009FDOQ3020009

Timothy M. Chan, Mihai Patrascu, Liam Roditty

Publication date: 29 July 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Abstract: Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in an undirected graph, subject to edge insertions and deletions. In this paper, we study two more challenging, yet equally fundamental problems. Subgraph connectivity asks to maintain an understanding of connectivity under vertex updates: updates can turn vertices on and off, and queries refer to the subgraph induced by "on" vertices. (For instance, this is closer to applications in networks of routers, where node faults may occur.) We describe a data structure supporting vertex updates in O (m^{2/3}) amortized time, where m denotes the number of edges in the graph. This greatly improves over the previous result [Chan, STOC'02], which required fast matrix multiplication and had an update time of O(m^0.94). The new data structure is also simpler. Geometric connectivity asks to maintain a dynamic set of n geometric objects, and query connectivity in their intersection graph. (For instance, the intersection graph of balls describes connectivity in a network of sensors with bounded transmission radius.) Previously, nontrivial fully dynamic results were known only for special cases like axis-parallel line segments and rectangles. We provide similarly improved update times, O (n^{2/3}), for these special cases. Moreover, we show how to obtain sublinear update bounds for virtually all families of geometric objects which allow sublinear-time range queries, such as arbitrary 2D line segments, d-dimensional simplices, and d-dimensional balls.

Full work available at URL: https://arxiv.org/abs/0808.1128

zbMATH Keywords

computational geometrydata structuresconnectivitydynamic graph algorithmsgeometric connectivityvertex updates

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (14)

• Title not available (Why is that?)
• Dynamic connectivity in disk graphs
• Dynamic connectivity for axis-parallel rectangles
• Dynamic geometric data structures via shallow cuttings
• Fully Dynamic Connectivity Oracles under General Vertex Updates
• Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
• Connectivity Oracles for Graphs Subject to Vertex Failures
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
• Title not available (Why is that?)
• Space-efficient fully dynamic DFS in undirected graphs
• Title not available (Why is that?)
• Mincut sensitivity data structures for the insertion of an edge
• Simplified kinetic connectivity for rectangles and hypercubes
• Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier

   Recommendations

• Dynamic Subgraph Connectivity with Geometric Applications 👍 👎
• New data structures for subgraph connectivity 👍 👎
• Dynamic Connectivity for Axis-Parallel Rectangles 👍 👎
• Dynamic connectivity for axis-parallel rectangles 👍 👎
• Fully Dynamic Connectivity Oracles under General Vertex Updates 👍 👎

This page was built for publication: Dynamic connectivity: connecting to networks and geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3020009)