Connectivity Oracles for Planar Graphs

We consider dynamic subgraph connectivity problems for planar undirected graphs. In this model there is a fixed underlying planar graph, where each edge and vertex is either "off" (failed) or "on" (recovered). We wish to answer connectivity queries with respect to the "on" subgraph. The model has two natural variants, one in which there are d edge/vertex failures that precede all connectivity queries, and one in which failures/recoveries and queries are intermixed. We present a d-failure connectivity oracle for planar graphs that processes any d edge/vertex failures in sort(d,n) time so that connectivity queries can be answered in pred(d,n) time. (Here sort and pred are the time for integer sorting and integer predecessor search over a subset of [n] of size d.) Our algorithm has two discrete parts. The first is an algorithm tailored to triconnected planar graphs. It makes use of Barnette's theorem, which states that every triconnected planar graph contains a degree-3 spanning tree. The second part is a generic reduction from general (planar) graphs to triconnected (planar) graphs. Our algorithm is, moreover, provably optimal. An implication of Pǎtrascu and Thorup's lower bound on predecessor search is that no d-failure connectivity oracle (even on trees) can beat pred(d,n) query time. We extend our algorithms to the subgraph connectivity model where edge/vertex failures (but no recoveries) are intermixed with connectivity queries. In triconnected planar graphs each failure and query is handled in O(logn) time (amortized), whereas in general planar graphs both bounds become O(log2n).

[1]  D. Barnette.  Trees in Polyhedral Graphs , 1966, Canadian Journal of Mathematics.

[2]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[3]  Dan E. Willard,et al.  Log-logarithmic worst-case range queries are possible in space ⊕(N) , 1983 .

[4]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[5]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[6]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[7]  David Eppstein,et al.  Maintenance of a minimum spanning forest in a dynamic planar graph , 1990, SODA '90.

[8]  Michael L. Fredman,et al.  Trans-dichotomous algorithms for minimum spanning trees and shortest paths , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9]  Gary L. Miller,et al.  A new graph triconnectivity algorithm and its parallelization , 1992, Comb..

[10]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[11]  Artur Czumaj,et al.  Bounded Degree Spanning Trees (Extended Abstract) , 1997, ESA.

[12]  Universitat-Gesamthochschule Paderborn.  BOUNDED DEGREE SPANNING TREES , 1997 .

[13]  David Eppstein,et al.  Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.

[14]  Stephen Alstrup,et al.  Marked ancestor problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[15]  Michael A. Bender,et al.  The LCA Problem Revisited , 2000, LATIN.

[16]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[17]  Daniele Frigioni,et al.  Dynamically Switching Vertices in Planar Graphs , 2000, Algorithmica.

[18]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[19]  Yijie Han,et al.  Integer sorting in O(n/spl radic/(log log n)) expected time and linear space , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[20]  Timothy M. Chan.  Dynamic subgraph connectivity with geometric applications , 2002, STOC '02.

[21]  Yijie Han.  Deterministic sorting in O(nlog log n) time and linear space , 2002, STOC '02.

[22]  Stephen Alstrup,et al.  Nearest common ancestors: a survey and a new distributed algorithm , 2002, SPAA.

[23]  Yijie Han,et al.  Deterministic sorting inO(nlog logn) time and linear space , 2002, STOC 2002.

[24]  Roberto Tamassia,et al.  On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.

[25]  Peter van Emde Boas,et al.  Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.

[26]  Swastik Kopparty,et al.  TO PLANAR GRAPHS , 2010 .

[27]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[28]  Mikkel Thorup,et al.  Planning for Fast Connectivity Updates , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[29]  Mikkel Thorup,et al.  Dynamic ordered sets with exponential search trees , 2002, J. ACM.

[30]  Mikkel Thorup,et al.  Oracles for Distances Avoiding a Failed Node or Link , 2008, SIAM J. Comput..

[31]  Timothy M. Chan,et al.  Dynamic Connectivity: Connecting to Networks and Geometry , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[32]  Timothy M. Chan,et al.  Dynamic Connectivity for Axis-Parallel Rectangles , 2006, Algorithmica.

[33]  David R. Karger,et al.  A nearly optimal oracle for avoiding failed vertices and edges , 2009, STOC '09.

[34]  Ran Duan,et al.  Dual-failure distance and connectivity oracles , 2009, SODA.

[35]  Ran Duan,et al.  New Data Structures for Subgraph Connectivity , 2010, ICALP.

[36]  Ran Duan,et al.  Connectivity oracles for failure prone graphs , 2010, STOC '10.