Connectivity oracles for failure prone graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 465-474

  Duan, Ran ^a   Pettie, Seth ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

connectivity

Indexed keywords

DYNAMIC GRAPH; EDGE FAILURES; FREE STATE; MODEL FIT; QUERY TIME; RANGE SEARCHING; REAL-WORLD SCENARIO; ROAD NETWORK; ROUTER NETWORKS; SUBGRAPHS; TIME POLYNOMIALS; UNDERLYING GRAPHS;

COMPUTATION THEORY; DATA STRUCTURES; MOTOR TRANSPORTATION; ROUTERS;

GRAPH THEORY;

EID: 77954743754     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806754     Document Type: Conference Paper

References (23)

1. S. Alstrup, G. S. Brodal, and T. Rauhe. New data structures for orthogonal range searching. In Proceedings 41st FOCS, pages 198-207, 2000.
2. 2) time. In Proceedings 45th FOCS, pages 238-247, 2004.
3. S. Arora, S. Rao, and U. V. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), 2009.
4. P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci., 65(1):38-72, 2002.
5. A. Bernstein and D. Karger. A nearly optimal oracle for avoiding failed vertices and edges. In Proceedings 41st STOC, pages 101-110, 2009.
6. T. Chan. Dynamic subgraph connectivity with geometric applications. SIAM J. Comput., 36(3):681-694, 2006.
7. T. M. Chan, M. Pǎtraşcu, and L. Roditty. Dynamic connectivity: Connecting to networks and geometry. In Proceedings 49th FOCS, pages 95-104, 2008.
8. C. Demetrescu and G. F. Italiano. Mantaining dynamic matrices for fully dynamic transitive closure. Algorithmica, 51(4):387-427, 2008. (Pubitemid 351705753)
9. 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.
10. 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.
11. 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.
12. M. L. Fredman and D. E. Willard. Surpassing the information-theoretic bound with fusion trees. J. Comput. Syst. Sci., 47(3):424-436, 1993.
13. D Frigioni and G. F. Italiano. Dynamically switching vertices in planar graphs. Algorithmica, 28(1):76-103, 2000.
14. R. Grossi and G. F. Italiano. Efficient splitting and merging algorithms for order decomposable problems. Information and Computation, 154(1):1-33, 1999.
15. 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.
16. M. Pǎtraşcu and M. Thorup. Time-space trade-offs for predecessor search. In Proceedings 38th ACM Symposium on Theory of Computing (STOC), pages 232-240, 2006.
17. M. Pǎtraşcu and M. Thorup. Planning for fast connectivity updates. In Proceedings 48th IEEE Symposium on Foundations of Computer Science (FOCS), pages 263-271, 2007.
18. 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.
19. P. Sankowski. Faster dynamic matchings and vertex connectivity. In Proceedings 8th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 118-126, 2007.
20. J. Sherman. Breaking the multicommodity flow barrier for O(√log n)-approximations to sparsest cut. CoRR, abs/0908.1379, 2009.
21. 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.
22. M. Thorup. Fully-dynamic min-cut. Combinatorica, 27(1):91-127, 2007.
23. P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In Proceedings 39th FOCS, pages 75-84, 1975.