New data structures for subgraph connectivity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 201-212

  Duan, Ran ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTIVITY STRUCTURES; GRAPH G; LINEAR SPACES; OPEN PROBLEMS; QUERY TIME; SUBGRAPHS; SUBLINEAR; SUBLINEAR TIME; UNDIRECTED GRAPH;

DATA STRUCTURES; LINGUISTICS; TRANSLATION (LANGUAGES);

GRAPH THEORY;

EID: 77955329951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_18     Document Type: Conference Paper

References (23)

1. Chan, T.: Dynamic subgraph connectivity with geometric applications. SIAM J. Comput. 36 (3), 681-694 (2006)
2. Chan, T. M., Pǎtraşcu, M., Roditty, L.: Dynamic connectivity: Connecting to networks and geometry. In: Proceedings 49th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 95-104 (2008)
3. Coppersmith, D., Winograd, T.: Matrix multiplication via arithmetic progressions. In: Proc. 19th ACM Symp. on the Theory of Computing (STOC), pp. 1-6 (1987)
4. Demetrescu, C., Italiano, G. F.: A new approach to dynamic all pairs shortest paths. J. ACM 51 (6), 968-992 (2004)
5. Demetrescu, C., Thorup, M., Chowdhury, R. A., Ramachandran, V.: Oracles for distances avoiding a failed node or link. SIAM J. Comput. 37 (5), 1299-1318 (2008)
6. Demetrescu, C., Italiano, G. F.: Trade-offs for fully dynamic transitive closure on dags: breaking through the o (n2 barrier. J. ACM 52 (2), 147-156 (2005)
7. Duan, R., Pettie, S.: Dual-failure distance and connectivity oracles. In: Proceedings 20th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 506-515 (2009)
8. Duan, R., Pettie, S.: Connectivity oracles for failure prone graphs. In: Proceedings 42nd Annual ACM Symposium on Theory of Computing, STOC (to appear, 2010)
9. Eppstein, D., Galil, Z., Italiano, G., Nissenzweig, A.: Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44 (5), 669-696 (1997)
10. Frederickson, G.: Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14 (4), 781-798 (1985)
11. Frigioni, D., Italiano, G. F.: Dynamically switching vertices in planar graphs. Algorithmica 28 (1), 76-103 (2000)
12. Henzinger, M., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46 (4), 502-516 (1999)
13. Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48 (4), 723-760 (2001)
14. King, V.: Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In: FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, Washington, DC, USA. IEEE Computer Society, Los Alamitos (1999)
15. King, V., Sagert, G.: A fully dynamic algorithm for maintaining the transitive closure. In: STOC 1999: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 492-498. ACM, New York (1999)
16. Pǎtraşcu, M., Thorup, M.: Planning for fast connectivity updates. In: Proceedings 48th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 263-271 (2007)
17. Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: Proceedings 36th ACM Symposium on Theory of Computing (STOC), pp. 184-191 (2004)
18. Roditty, L., Zwick, U.: On dynamic shortest paths problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 580-591. Springer, Heidelberg (2004)
19. Roditty, L., Zwick, U.: Improved dynamic reachability algorithms for directed graphs. SIAM J. Comput. 37 (5), 1455-1471 (2008)
20. Sankowski, P.: Dynamic transitive closure via dynamic matrix inverse. In: Proceedings 45th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 509-517 (2004)
21. Thorup, M.: Decremental dynamic connectivity. J. Algor. 33 (2), 229-243 (1999)
22. Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proceedings 32nd ACM Symposium on Theory of Computing (STOC), pp. 343-350 (2000)
23. Thorup, M.: Worst-case update times for fully-dynamic all-pairs shortest paths. In: Proceedings 37th ACM Symposium on Theory of Computing (STOC), pp. 112-119 (2005)