Computer Science – Data Structures and Algorithms
Scientific paper
2008-08-07
Computer Science
Data Structures and Algorithms
Full version of a paper to appear in FOCS 2008
Scientific paper
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.
Chan Timothy M.
Patrascu Mihai
Roditty Liam
No associations
LandOfFree
Dynamic Connectivity: Connecting to Networks and Geometry does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dynamic Connectivity: Connecting to Networks and Geometry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Connectivity: Connecting to Networks and Geometry will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-29107