Connectivity Oracles for Planar Graphs

  title={Connectivity Oracles for Planar Graphs},
  author={Glencora Borradaile and Seth Pettie and Christian Wulff-Nilsen},
  • Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen
  • Published in SWAT 2012
  • Computer Science, Mathematics
  • 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… CONTINUE READING
    Connectivity Oracles for Graphs Subject to Vertex Failures
    • 13
    • PDF
    Approximate Distance Oracles Subject to Multiple Vertex Failures


    Publications referenced by this paper.
    Fast Algorithms for Finding Nearest Common Ancestors
    • 1,184
    • PDF
    Dividing a Graph into Triconnected Components
    • 807
    • PDF
    Maintenance of a minimum spanning forest in a dynamic planar graph
    • 152
    • PDF
    On-line maintenance of triconnected components with SPQR-trees
    • 160
    • PDF
    Data structures for on-line updating of minimum spanning trees
    • 207
    Oracles for Distances Avoiding a Failed Node or Link
    • 88
    • PDF
    A nearly optimal oracle for avoiding failed vertices and edges
    • 81
    • PDF
    Planning for Fast Connectivity Updates
    • 70
    • PDF
    A Linear Time Implementation of SPQR-Trees
    • 237
    • PDF