Ran Duan
ABSTRACT
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways. In this paper we consider a dynamic subgraph model. We assume there is some fixed, underlying graph that can be preprocessed ahead of time. The graph is subject only to vertices and edges flipping "off" (failing) and "on" (recovering), where queries naturally apply to the subgraph on edges/vertices currently flipped on. This model fits most real world scenarios, where the topology of the graph in question (say a router network or road network) is constantly evolving due to temporary failures but never deviates too far from the ideal failure-free state.
We present the first efficient connectivity oracle for graphs susceptible to vertex failures. Given vertices u and v and a set D of d failed vertices, we can determine if there is a path from u to v avoiding D in time polynomial in d log n. There is a tradeoff in our oracle between the space, which is roughly mnε, for 0< ε≤ 1, and the polynomial query time, which depends on ε. If one wanted to achieve the same functionality with existing data structures (based on edge failures or twin vertex failures) the resulting connectivity oracle would either need exorbitant space (Ω(nd)) or update time Ω(dn), that is, linear in the number of vertices.
Our connectivity oracle is therefore the first of its kind. As a byproduct of our oracle for vertex failures we reduce the problem of constructing an edge-failure oracle to 2D range searching over the integers. We show there is an ~O(m)-space oracle that processes any set of d failed edges in O(d2 log log n) time and, thereafter, answers connectivity queries in O(log log n) time. Our update time is exponentially faster than a recent connectivity oracle of Patrascu and Thorup for bounded d, but slower as a function of d.
- S. Alstrup, G. S. Brodal, and T. Rauhe. New data structures for orthogonal range searching. In Proceedings 41st FOCS, pages 198--207, 2000. Google Scholar
Digital Library
- S. Arora, E. Hazan, and S. Kale. O(√log n) approximation to sparsest cut in ~O(n2) time. In Proceedings 45th FOCS, pages 238--247, 2004. Google ScholarDigital Library
- S. Arora, S. Rao, and U. V. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), 2009. Google ScholarDigital Library
- P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci., 65(1):38--72, 2002. Google ScholarDigital Library
- A. Bernstein and D. Karger. A nearly optimal oracle for avoiding failed vertices and edges. In Proceedings 41st STOC, pages 101--110, 2009. Google ScholarDigital Library
- T. Chan. Dynamic subgraph connectivity with geometric applications. SIAM J. Comput., 36(3):681--694, 2006. Google ScholarDigital Library
- T. M. Chan, M. Patrascu, and L. Roditty. Dynamic connectivity: Connecting to networks and geometry. In Proceedings 49th FOCS, pages 95--104, 2008. Google ScholarDigital Library
- C. Demetrescu and G. F. Italiano. Mantaining dynamic matrices for fully dynamic transitive closure. Algorithmica, 51(4):387--427, 2008. Google ScholarDigital Library
- C. Demetrescu, M. Thorup, R. A. Chowdhury, and V. Ramachandran. Oracles for distances avoiding a failed node or link. SIAM J. Comput., 37(5):1299--1318, 2008. Google ScholarDigital Library
- R. Duan and S. Pettie. Bounded-leg distance and reachability oracles. In Proceedings 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 436--445, 2008. Google ScholarDigital Library
- R. Duan and S. Pettie. Dual--failure distance and connectivity oracles. In Proceedings 20th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 506--515, 2009. Google ScholarDigital Library
- M. L. Fredman and D. E. Willard. Surpassing the information--theoretic bound with fusion trees. J. Comput. Syst. Sci., 47(3):424--436, 1993. Google ScholarDigital Library
- D Frigioni and G. F. Italiano. Dynamically switching vertices in planar graphs. Algorithmica, 28(1):76--103, 2000.Google ScholarDigital Library
- R. Grossi and G. F. Italiano. Efficient splitting and merging algorithms for order decomposable problems. Information and Computation, 154(1):1--33, 1999. Google ScholarDigital Library
- J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM, 48(4):723--760, 2001. Google ScholarDigital Library
- M. Patrascu and M. Thorup. Time-space trade-offs for predecessor search. In Proceedings 38th ACM Symposium on Theory of Computing (STOC), pages 232--240, 2006. Google ScholarDigital Library
- M. Patrascu and M. Thorup. Planning for fast connectivity updates. In Proceedings 48th IEEE Symposium on Foundations of Computer Science (FOCS), pages 263--271, 2007. Google ScholarDigital Library
- L. Roditty and U. Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In Proceedings 36th ACM Symposium on Theory of Computing (STOC), pages 184--191, 2004. Google ScholarDigital Library
- P. Sankowski. Faster dynamic matchings and vertex connectivity. In Proceedings 8th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 118--126, 2007. Google ScholarDigital Library
- J. Sherman. Breaking the multicommodity flow barrier for O(√log n)-approximations to sparsest cut. CoRR, abs/0908.1379, 2009.Google Scholar
- M. Thorup. Worst-case update times for fully-dynamic all-pairs shortest paths. In Proceedings 37th ACM Symposium on Theory of Computing (STOC), pages 112--119, 2005. Google ScholarDigital Library
- M. Thorup. Fully-dynamic min-cut. Combinatorica, 27(1):91--127, 2007. Google ScholarDigital Library
- P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In Proceedings 39th FOCS, pages 75--84, 1975. Google ScholarDigital Library
Index Terms
- Connectivity oracles for failure prone graphs
Recommendations
On the connectivity of p-diamond-free graphs
For a vertex v of a graph G, we denote by d(v) the degree of v. The local connectivity@k(u,v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as @k(G)=min{@k(u,v)|u,v@...
On the connectivity of p-diamond-free vertex transitive graphs
Let G be a graph of order n(G), minimum degree @d(G) and connectivity @k(G). We call the graph Gmaximally connected when @k(G)=@d(G). The graph G is said to be superconnected if every minimum vertex cut isolates a vertex. For an integer p>=1, we define ...
On the connectivity and restricted edge-connectivity of 3-arc graphs
Let G denote the symmetric digraph of a graph G . A 3-arc is a 4-tuple ( y , a , b , x ) of vertices such that both ( y , a , b ) and ( a , b , x ) are paths of length 2 in G . The 3-arc graph X ( G ) of a given graph G is defined to have vertices the ...
Comments