Dynamic connectivity: Connecting to networks and geometry

SIAM Journal on Computing

Volumn 40, Issue 2, 2011, Pages 333-349

  Chan, Timothy M ^a   P̌atraşcu, Mihai ^b   Roditty, Liam ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b AT AND T LABS RESEARCH   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

Computational geometry; Connectivity; Data structures; Dynamic graph algorithms

Indexed keywords

AMORTIZED TIME; CONNECTIVITY; DYNAMIC GRAPH ALGORITHMS; FAST MATRIX MULTIPLICATION; GEOMETRIC OBJECTS; INSERTIONS AND DELETIONS; INTERSECTION GRAPH; LINE SEGMENT; NETWORK OF SENSORS; SUBGRAPHS; SUBLINEAR; SUBLINEAR TIME; TRANSMISSION RADIUS; UNDIRECTED GRAPH;

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; ROUTERS;

GRAPH THEORY;

EID: 79957524588     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090751670     Document Type: Article

References (41)

1. P. Afshani and T. M. Chan, Dynamic connectivity for axis-parallel rectangles, in Proceedings of the 14th European Symposium on Algorithms (ESA), 2006, pp. 16-27. (Pubitemid 44699638)
2. P. K. Agarwal and J. Erickson, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, eds., American Mathematical Society, Providence, RI, 1999, pp. 1-56.
3. P. K. Agarwal and J. Matoušek, On range searching with semialgebraic sets, Discrete Comput. Geom., 11 (1994), pp. 393-418.
4. P. K. Agarwal and M. J. van Kreveld, Connected component and simple polygon intersection searching, Algorithmica, 15 (1996), pp. 626-660. (Pubitemid 126422535)
5. N. Alon, R. Yuster, and U. Zwick, Finding and counting given length cycles, Algorithmica, 17 (1997), pp. 209-223. (Pubitemid 127440916)
6. T. M. Chan, Dynamic subgraph connectivity with geometric applications, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 7-13. (Pubitemid 35009355)
7. T. M. Chan, A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 1196-1202. (Pubitemid 43275347)
8. T. M. Chan, Optimal partition trees, in Proceedings of the 26th Annual ACM Symposium on Computational Geometry (SoCG), 2010, pp. 1-10.
9. D. Coppersmith, Rectangular matrix multiplication revisited, J. Complexity, 13 (1997), pp. 42-49. (Pubitemid 127172722)
10. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
11. C. Demetrescu and G. F. Italiano, A new approach to dynamic all pairs shortest paths, J. ACM, 51 (2004), pp. 968-992. (Pubitemid 40818312)
12. 2) barrier, J. ACM, 52 (2005), pp. 147-156. (Pubitemid 41655756)
13. R. Duan, New data structures for subgraph connectivity, in Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag, Berlin, Heidelberg, 2010, pp. 201-212.
14. D. Eppstein, Dynamic Euclidean minimum spanning trees and extrema of binary functions, Discrete Comput. Geom., 13 (1995), pp. 111-122.
15. D. Eppstein, Testing bipartiteness of geometric intersection graphs, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 853- 861.
16. G. N. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications, SIAM J. Comput., 14 (1985), pp. 781-798.
17. D. Frigioni and G. F. Italiano, Dynamically switching vertices in planar graphs, Algorithmica, 28 (2000), pp. 76-103.
18. L. J. Guibas, J. Hershberger, S. Suri, and L. Zhang, Kinetic connectivity for unit disks, Discrete Comput. Geom., 25 (2001), pp. 591-610.
19. L. J. Guibas, M. H. Overmars, and M. Sharir, Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques, in Proceedings of the 1st Scandinavian Workshop on Algorithm Theory (SWAT), Springer-Verlag, London, 1988, pp. 64-73.
20. M. R. Henzinger and V. King, Randomized fully dynamic graph algorithms with polylogarithmic time per operation, J. ACM, 46 (1999), pp. 502-516.
21. J. Hershberger and S. Suri, Kinetic connectivity of rectangles, in Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG), 1999, pp. 237-246.
22. J. Hershberger and S. Suri, Simplified kinetic connectivity for rectangles and hypercubes, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 158-167.
23. 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 (2001), pp. 723-760.
24. X. Huang and V. Y. Pan, Fast rectangular matrix multiplication and applications, J. Complexity, 14 (1998), pp. 257-299. (Pubitemid 128347318)
25. H. Imai, Finding connected components of an intersection graph of squares in the Euclidean plane, Inform. Process. Lett., 15 (1982), pp. 125-128.
26. H. Imai and T. Asano, Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane, J. Algorithms, 4 (1983), pp. 310-323.
27. A. Itai and M. Rodeh, Finding a minimum circuit in a graph, SIAM J. Comput., 7 (1978), pp. 413-423.
28. V. King, Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp. 81-91.
29. V. King and G. Sagert, A fully dynamic algorithm for maintaining the transitive closure, J. Comput. System Sci., 65 (2002), pp. 150-167.
30. M. A. López and R. Thurimella, On computing connected components of line segments, IEEE Trans. Comput., 44 (1995), pp. 597-601.
31. J. Matoušek, Efficient partition trees, Discrete Comput. Geom., 8 (1992), pp. 315-334.
32. J. Matoušek, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom., 10 (1993), pp. 157-182.
33. M. Pǎtraşcu and E. D. Demaine, Logarithmic lower bounds in the cell-probe model, SIAM J. Comput., 35 (2006), pp. 932-963. (Pubitemid 44231262)
34. M. Pǎtraşcu and M. Thorup, Planning for fast connectivity updates, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 263-271.
35. L. Roditty and U. Zwick, A fully dynamic reachability algorithm for directed graphs with an almost linear update time, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), 2004, pp. 184-191.
36. P. Sankowski, Dynamic transitive closure via dynamic matrix inverse, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004, pp. 509-517. (Pubitemid 40575312)
37. M. Thorup, Near-optimal fully-dynamic graph connectivity, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 343-350.
38. M. Thorup, Worst-case update times for fully-dynamic all-pairs shortest paths, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005, pp. 112-119. (Pubitemid 43098578)
39. M. Thorup, Fully-dynamic min-cut, Combinatorica, 27 (2007), pp. 91-127.
40. R. Yuster and U. Zwick, Detecting short directed cycles using rectangular matrix multiplication and dynamic programming, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 247-253.
41. R. Yuster and U. Zwick, Fast sparse matrix multiplication, ACM Trans. Algorithms, 1 (2005), pp. 2-13.