Sparsification-a technique for speeding up dynamic graph algorithms

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 60-69

  Eppstein, David ^a   Galil, Zvi ^b   Italiano, Giuseppe F ^c   Nissenzweig, Amnon ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c Och Spine at New York Presbyterian Hospitals   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

DYNAMIC ALGORITHM; DYNAMIC GRAPH ALGORITHMS; EDGE CONNECTIVITY; GRAPH CONNECTIVITY; KEEP TRACK OF; MINIMUM SPANNING FORESTS; SPARSE GRAPHS; SPARSIFICATION;

COMPUTER SCIENCE;

EID: 84990177512     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267818     Document Type: Conference Paper

References (31)

1. G. Di Battista and R. Tamassia. On-line graph algorithms with SPQR-trees. 17th Int. Coll. Automata, Languages, and Programming (1990) 598-611.
2. J.L. Bentley and J.B. Saxe. Decomposable searching problems I: static-to-dynamic transformation. J. Algorithms 1 (1980) 301-358.
3. A.M. Berman, M.C. Paull, and B.G. Ryder. Proving relative lower bounds for incremental algorithms. Acta Informatica 27 (1990) 665-683.
4. J. Cheriyan and R. Thurimella. Algorithms for parallel k-vertex connectivity and sparse certificates. 23rd ACM Symp. Theory of Computing (1991) 391-401.
5. P.F. Dietz and D.D. Sleator. Two algorithms for maintaining order in a list. 19th ACM Symp. Theory of Computing (1987) 365-372.
6. D. Eppstein. Finding the k smallest spanning trees. 2nd Scand. Worksh. Algorithm Theory (1990) 38-47. BIT 32 (1992) 237-248.
7. D. Eppstein. Offline algorithms for dynamic minimum spanning tree problems. 2nd Worksh. Algorithms and Data Structures (1991) 392-399.
8. D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms 13 (1992) 33-54.
9. T. Feder and M. Mihail. Balanced matroids. 24th ACM Symp. Theory of Computing (1992) 26-38.
10. G.N. Frederickson. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14 (1985) 781-798.
11. G.N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. 32nd IEEE Symp. Foundations of Computer Science (1991) 632-641.
12. H. Gabow. A matroid approach to finding edge connectivity and packing arborescences. 23rd ACM Symp. Theory of Computing (1991) 112-122.
13. H. Gabow. Applications of a poset representation to edge connectivity and graph rigidity. 32nd IEEE Symp. Foundations of Computer Science (1991) 812-821.
14. H.N. Gabow, Z. Galil, T.H. Spencer, and R.E. Tarjan. Efficient algorithms for minimum spanning trees on directed and undirected graphs. Combinatorica 6 (1986) 109-122.
15. H.N. Gabow and M. Stallman. Efficient algorithms for graphic matroid intersection and parity. 12th Int. Coll. Automata, Languages, and Programming (1985) 210-220.
16. Z. Galil and G.F. Italiano. Fully dynamic algorithms for edge-connectivity problems. 23rd ACM Symp. Theory of Computing (1991) 317-327.
17. Z. Galil and G.F. Italiano. Maintaining bicon-nected components of dynamic planar graphs. 18th Int. Coll. Automata, Languages, and Programming (1991) 339-350.
18. Z. Galil and G.F. Italiano. Reducing edge connectivity to vertex connectivity. SIGACT News 22(1) (1991) 57-61.
19. Z. Galil and G.F. Italiano. Fully dynamic algorithms for 3-edge connectivity. Manuscript, 1992.
20. X. Han, P. Kelsen, V. Ramachandran, and R.E. Tarjan. Computing minimal spanning subgraphs in linear time. 3rd ACM/SIAM Symp. Discrete Algorithms (1992) 146-156.
21. J. Hopcroft and R.E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973) 135-158.
22. A. Kanevsky, R. Tamassia, G. Di Battista, and J. Chen. On-line maintenance of the four-connected components of a graph. 32nd IEEE Symp. Foundations of Computer Science (1991) 793-801.
23. J. A. La Poutre. Dynamic graph algorithms and data structures. Ph.D. Thesis, Utrecht University, September 1991.
24. J. A. La Poutre. Maintenance of triconnected components of graphs. 19th Int. Coll. Automata, Languages, and Programming (1992) 354-365.
25. H. Nagamochi and T. Ibaraki. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7 (1992) 583-596.
26. M. Overmars. The design of dynamic data structures. Lecture Notes in Computer Science 156 (1983).
27. M. Rauch. Fully dynamic biconnectivity in graphs. 33rd IEEE Symp. Foundations of Computer Science (1992), these proceedings.
28. D. Sleator and R.E. Tarjan. A data structure for dynamic trees. J. Comput. Sys. Sci. 26 (1983) 362-391.
29. R.E. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput 1 (1972) 146-160.
30. R. Thurimella. Techniques for the design of parallel graph algorithms. Ph.D. Thesis, Univ. Texas, Austin, 1989.
31. J. Westbrook and R.E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica 7 (1992) 433-464.