Sparsification - A technique for speeding up dynamic graph algorithms

Journal of the ACM

Volumn 44, Issue 5, 1997, Pages 669-696

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

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Columbia University ^*  (United States)

^c CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^d TEL AVIV UNIVERSITY   (Israel)

^e Department of Biomedical Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; EDGE DETECTION; GRAPH THEORY;

DYNAMIC GRAPH ALGORITHMS; EDGE CONNECTIVITY; SPARSIFICATION; VERTEX CONNECTIVITY;

ALGORITHMS;

EID: 0031221723     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/265910.265914     Document Type: Article

References (47)

1. ALBERTS, D., CATTANEO, G., AND ITALIANO, G. F. 1997. An empirical study of dynamic graph algorithms. ACM J. Exper. Algorithmics, to appear.
2. AMATO, G., CATTANEO, G., AND ITALIANO, G. F. 1997. Experimental analysis of dynamic minimum spanning tree algorithms. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 314-323.
3. BERMAN, A. M., PAULL, M. C., AND RYDER, B. G. 1990. Proving relative lower bounds for incremental algorithms. Acta Inf. 27, 665-683.
4. CHERIYAN, J., KAO, M. Y., AND THURIMELLA, R. 1993. Scan-first search and sparse certificates-An improved parallel algorithm for k-vertex connectivity. SIAM J. Comput. 22, 157-174.
5. CHERIYAN, J., AND THURIMELLA, R. 1991. Algorithms for parallel k-vertex connectivity and sparse certificates. In Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing (New Orleans, La., May 6-8). ACM, New York, pp. 391-401.
6. DI BATTISTA, G., AND TAMASSIA, R. 1990. On-line graph algorithms with SPQR-trees. In Proceedings of the 17th International Collquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 443. Springer-Verlag, Berlin, Germany, pp. 598-611.
7. DIETZ, P., AND SLEATOR, D. 1987. Two algorithms for maintaining order in a list. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (New York, N.Y., May 25-27). ACM, New York, pp. 365-372.
8. DIXON, B., RAUCH, M., AND TARJAN, R. E. 1992. Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput., 1184-1192.
9. EPPSTEIN, D. 1992. Finding the k smallest spanning trees. BIT 32, 237-248.
10. EPPSTEIN, D. 1994a. Offline algorithms for dynamic minimum spanning tree problems. J. Algor. 17, 237-250.
11. EPPSTEIN, D. 1994b. Tree-weighted neighbors and geometric k smallest spanning trees. Int. J. Comput. Geom. Appl. 4, 229-238.
12. EPPSTEIN, D., GALIL, Z., ITALIANO, G. F., AND SPENCER, T. H. 1996. Separator based sparsification I. Planarity testing and minimum spanning trees. J. Comput. Syst. Sci, 52, 1 (Feb.), 3-27.
13. EPPSTEIN, D., GALIL, Z., ITALIANO, G. F., AND SPENCER, T. H. 1998. Separator based sparsification II. Planarity testing and minimum spanning trees. SIAM J. Comput., to appear.
14. EPPSTEIN, D., ITALIANO, G. F., TAMASSIA, R., TARJAN, R. E., WESTBROOK, J., AND YUNG, M. 1992. Maintenance of a minimum spanning forest in a dynamic plane growth. J. Algor. 13, 33-54.
15. FEDER, T., AND MIHAIL, M. 1992. Balanced matroids. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 26-38.
16. FERNANDEZ-BACA, D., SLUTZKI, G., AND EPPSTEIN, D. 1996. Using sparsification for parametric minimum spanning tree problems. Nordic J. Comput. 3, 4 (Winter), 352-366 (Special issue for the 5th SWAT).
17. FREDERICKSON, G. N. 1985. Data structures for on-line updating of minimum spanning trees. SIAM J. Comput. 14, 781-798.
18. FREDERICKSON, G. N. 1997. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM J. Comput. 26, 2 (Apr.), 484-538.
19. FREDERICKSON, G. N., AND SRINIVAS, M. A. 1989. Algorithms and data structures for an expanded family of matroid intersection problems. SIAM J. Comput. 18, 112-138.
20. FREDMAN, M. L., AND HENZIGER, M. R. 1997. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica, to appear.
21. GABOW, H. N. 1991a. Applications of a poset representation to edge connectivity and graph rigidity. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 812-821.
22. GABOW, H. N. 1991b. A matroid approach to finding edge connectivity and packing arborescenes. In Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing (New Orleans, La., May 6-8). ACM, New York, pp. 112-122.
23. GABOW, H. N., AND STALLMAN, M. 1985. Efficient algorithms for graphic matroid intersection and parity. In Proceedings of the 12th International Colloquium of Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 194. Springer-Verlag, Berlin, Germany, pp. 339-350.
24. GALIL, Z., AND ITALIANO, G. F. 1991a. Fully dynamic algorithms for 3-edge-connectivity. Unpublished manuscript.
25. GALIL, Z., AND ITALIANO, G. F. 1991b. Maintaining biconnected components of dynamic planar graphs. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 510. Springer-Verlag, Berlin, Germany, pp. 339-350.
26. GALIL, Z., AND ITALIANO, G. F. 1991c. Reducing edge connectivity to vertex connectivity. Sigact News 22, 57-61.
27. GALIL, Z., AND ITALIANO, G. F. 1992. Fully dynamic algorithms for 2-edge-connectivity. SIAM J. Comput. 21, 1047-1069.
28. GALIL, Z., AND ITALIANO, G. F. 1993. Maintaining the 3-edge-connected components of a graph on-line. SIAM J. Comput. 22, 11-28.
29. HAN, X., KELSEN, P., RAMACHANDRAN, V., AND TARJAN, R. E. 1995. Computing minimal spanning subgraphs in linear time. SIAM J. Comput. 24, 1332-1358.
30. HARARY, F. 1969. Graph Theory. Addison-Wesley, Reading, Mass.
31. HENZINGER, M. R., AND KING, V. 1995a. Fully dynamic biconnectivity and transitive closure. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science. IEEE, New York.
32. HENZINGER, M. R., AND KING, V. 1995b. Randomized dynamic graph algorithms with polylogarithmic time per operation. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 519-527.
33. HENZINGER, M. R., AND KING, V. 1997. Maintaining minimum spanning trees in dynamic graphs. In Proceedings of the 24th International Colloquium Automata, Languages, and Programming. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany.
34. HENZINGER, M. R., AND LA POUTRÉ, J. A. 1995. Certificates and fast algorithms for biconnectivity in fully dynamic graphs. In Proceedings of the 3rd European Symposium on Algorithms.
35. HOPCROFT, J., AND TARJAN, R. E. 1973. Dividing a graph into triconnected components. SIAM J. Comput. 2, 135-158.
36. KANEVSKY, A., TAMASSIA, R., DI BATTISTA, G., AND CHEN, J. 1991. On-line maintenance of the four-connected components of a graph. In Proceedings of the 32nd IEEE Symposium Foundations of Computer Science. IEEE, New York, pp. 793-801.
37. KARGER, D. R., KLEIN, P. N., AND TARJAN, R. E. 1995. A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42, 321-328.
38. KHANNA, S., MOTWANI, R., AND WILSON, R. H. 1996. On certificates and lookahead on dynamic graph problems. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (Atlanta, Ga., Jan. 28-30). ACM, New York, pp. 222-231.
39. KING, V. 1995. A simpler minimum spanning tree verification algorithm. In Proceedings of the 4th Workshop Algorithms and Data Structures, pp. 440-448.
40. LA POUTRÉ, J. A. 1991. Dynamic graph algorithms and data structures. Ph.D. Dissertation. Department of Computer Science, Utrecht Univ.
41. LAWLER, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Reinhart and Winston, New York.
42. NAGAMOCHI, H., AND IBARAKI, T. 1992. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583-596.
43. RAUCH, M. H. 1995. Fully dynamic biconnectivity in graphs. Algorithmica 13, 6 (June), 503-538.
44. SLEATOR, D. D., AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 24, 362-381.
45. TARJAN, R. E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146-160.
46. THURIMELLA, R. 1989. Techniques for the design of parallel graph algorithms. Ph.D. Dissertation. Univ. Texas, Austin, Austin, Tex.
47. WESTBROOK, J., AND TARJAN, R. E. 1992. Maintaining bridge-connected and biconnected components on-line. Algorithmica 7, 433-464.