Separator based sparsification: I. Planarity testing and minimum spanning trees

Journal of Computer and System Sciences

Volumn 52, Issue 1, 1996, Pages 3-27

  Eppstein, David ^a   Galil, Zvi ^b,c   Italiano, Giuseppe F ^d   Spencer, Thomas H ^e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Columbia University ^*  (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

^e UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; QUERY LANGUAGES;

DYNAMIC GRAPH ALGORITHM; EDGE DELETIONS; EDGE INSERTIONS; MINIMUM SPANNING TREES; PLANARITY TESTING; SPARSIFICATION;

DATA STRUCTURES;

EID: 0030086069     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0002     Document Type: Article

References (18)

1. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan, Making data structures persistent, J. Comput. System Sci. 38 (1989), 86-124.
2. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsification A technique for speeding up dynamic graph algorithms, in "33rd IEEE Symp. on Foundations of Computer Science, 1992," pp. 60-69.
3. D. Eppstein, Z. Galil, and G. F. Italiano, "Improved Sparsification," Tech. Report 93-20, Department of Information and Computer Science, University of California, Irvine, 1993.
4. D. Eppstein, Z. Galil, G. F. Italiano, and T. H. Spencer, Separator based sparsification for dynamic planar graph algorithms, in "25th Annual ACM Symposium on Theory of Computing, 1993," pp. 208-217.
5. D. Eppstein, Z. Galil, G. F. Italiano, and T. H. Spencer, Separator based sparsification II: Edge and vertex connectivity, Manuscript, 1993.
6. 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.
7. G. N. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications, SIAM J. Comput. 14 (1985), 781-798.
8. G. N. Frederickson, Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees, in "32nd IEEE Symp. Foundations of Computer Science, 1991," pp. 632-641.
9. H. N. Gabow and M. Stallman, Efficient algorithms for graphic matroid intersection and parity, in "12th Int. Colloq. Automata, Languages, and Programming," Lect. Notes Comput. Sci., Vol. 194, pp. 210-220, Springer-Verlag, New York/Berlin, 1985.
10. Z. Galil and G. F. Italiano, Maintaining biconnected components of dynamic planar graphs, in "18th Int. Colloq. Automata, Languages, and Programming," Lect. Notes Comput. Sci., Vol. 510, pp. 339-350, Springer-Verlag, New York/Berlin, 1991.
11. Z. Galil, G. F. Italiano, and N. Sarnak, Fully dynamic planarity testing, in "24th ACM Sympos. Theory of Computing, 1992," pp. 495-506.
12. D. Giammarresi and G. F. Italiano, Dynamic 2- and 3-connectivity on planar graphs, in "3rd Scandinavian Workshop on Algorithm Theory," Lect. Notes Comput. Sci, Vol. 621, pp. 221-232, Springer-Verlag, New York/Berlin, 1992.
13. J. R. Gilbert, "Graph Separator Theorems and Sparse Gaussian Elimination," Ph.D. thesis, Stanford University, 1980.
14. M. T. Goodrich, Planar separators and parallel polygon triangulation, in "24th ACM Symp. Theory of Computing, 1992," pp. 507-516.
15. J. Hershberger, M. Rauch, and S. Suri, Fully dynamic 2-connectivity on planar graphs, in "3rd Scandinavian Workshop on Algorithm Theory" Lect. Notes Comput. Sci., Vol. 621, pp. 233-244, Springer-Verlag, New York/Berlin, 1992;
16. G. F. Italiano, J. A. La Poutré, and M. Rauch, Fully dynamic planarity testing in planar embedded graphs, in "1st Annual European Symposium on Algorithms, 1993."
17. M. Rauch, Fully dynamic biconnectivity in graphs, in "33rd IEEE Symp. Foundations of Computer Science, 1992," pp. 50-59.
18. R. Tamassia, A dynamic data structure for planar graph embedding, in "15th Int. Colloq. Automata, Languages, and Programming," Lect. Notes Comput. Sci., Vol. 317, pp. 576-590, Springer-Verlag, New York/Berlin, 1988.