Fully Dynamic Planarity Testing with Applications

Journal of the ACM

Volumn 46, Issue 1, 1999, Pages 28-91

  Galil, Zvi ^a,d   Italiano, Giuseppe F ^b   Sarnak, Neil ^c,e  

^a Columbia University ^*  (United States)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

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

^d Department of Earth and Environmental Sciences   (United States)

^e Goldman Sachs Group   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038517121     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/300515.300517     Document Type: Article

References (69)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. AUSIELLO, G., ITALIANO, G. F., MARCHETTI-SPACCAMELA, A., AND NANNI, U. 1991. Incremental algorithms for minimal length paths. J. Algorithms 12, 615-638.
3. BIENSTOCK, D., AND MONMA, C. 1988. On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17, 53-76.
4. BOOTH, K. S., AND LUEKER, G. S. 1976. Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335-379.
5. CHERIYAN, J., KAO, M. Y., AND THURMIELLA, R. 1993. Scan-first search and sparse certificates-An improved parallel algorithm and k-vertex connectivity. SIAM J. Comput. 22, 157-174.
6. CHERIYAN, J., AND MAHESHWARI, S. N. 1988. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9, 507-537.
7. COHEN, R. F., AND TAMASSIA, R. 1991. Dynamic expression trees and their applications. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 28-30). ACM, New York, pp. 52-61.
8. DANTZIG, G. B., AND FULKERSON, D. R. 1956. On the max-flow min-cut theorem of networks. Ann. Math. Study 38, 215-221.
9. DI BATTISTA, G., AND TAMASSIA, R. 1989. Incremental planarity testing. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 436-441.
10. DI BATTISTA, G., AND TAMASSIA, R. 1990. On-line graph algorithms with SPQR-tres. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 443. Springer-Verlag, Berlin, Germany, pp. 598-611.
11. EDMONDS, J. 1960. A combinatorial representation for polyhedral surfaces. Not. Am. Math Soc. 7, 646.
12. EPPSTEIN, D., GALIL, Z., ITALIANO, G. F., AND NISSENZWEIG, A. 1997. Sparsification-A technique for speeding-up dynamic graph algorithms. J. ACM 44, 669-696.
13. 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.
14. EPPSTEIN, D., GALIL, Z., ITALIANO, G. F., AND SPENCER, T. H. 1999. Separator based sparsification II: Edge and vertex connectivity. SIAM J. Comput. 28, 1 (Feb.), 341-381.
15. 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 graph. J. Algorithms 13, 33-54.
16. EVEN, S. 1979. Graph Algorithms. Computer Science Press, Potomac, Md.
17. EVEN, S., AND GAZIT, H. 1985. Updating distances in dynamic graphs. Meth. Oper. Res. 49, 371-387.
18. EVEN, S., ITKIS, G., AND RAJSBAUM, S. 1995. On mixed connectivity certificates. In Proceedings of the 3rd European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 979. Springer-Verlag, Berlin, Germany, pp. 1-16.
19. EVEN, S., AND SHILOACH, Y. 1981. An on-line edge deletion problem. J. ACM 23, 1 (Jan.), 1-4.
20. EVEN, S., AND TARJAN, R. E. 1976. Computing an st-numbering. Theor. Comput. Sci. 2, 339-344.
21. FORTUNE, S. 1987. A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153-174.
22. FRANK, A., IBARAKI, T., AN NAGAMOCHI, H. 1993. On sparse subgraphs preserving connectivity properties. J. Graph. Theor. 17, 275-281.
23. FREDERICKSON, G. N. 1985. Data structures for on-line updating of minimum spanning trees. SIAM J. Comput. 14, 781-798.
24. FREDERICKSON, G. N. 1997. Ambivalent data structures for dynamic 2-edge-connectivity and k-smallest spanning trees. SIAM J. Comput. 14, 781-798.
25. GABOW, H. N. 1991a. Applications of a poset representation to edge connectivity and graph rigidity. In Proceedings in 32nd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, Calif., pp. 812-821.
26. GABOW, H. N. 1991b. A matroid approach to finding edge connectivity and packing arborenscences. In Proceedings of the 23rd ACM Symposium Theory of Computing ACM, New York, pp. 112-122.
27. GABOW, H. N., AND STALLMAN, M. 1985. Efficient algorithms for graphic matroid intersection and parity. In Proceedings of the 12th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 510. Springer-Verlag, Berlin, Germany, pp. 210-220.
28. GALIL, Z., AND ITALIANO, G. F. 1991. 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.
29. GALIL, Z., AND ITALIANO, G. F. 1992. Fully dynamic algorithms for 2-edge-connectivity. SIAM J. Comput. 21, 1047-1069.
30. GALIL, Z., AND ITALIANO, G. F. 1993. Maintaining the 3-edge-connected components of a graph on-line. SIAM J. Comput. 22, 11-28.
31. GALIL, Z., ITALIANO, G. F., AND SARNAK, N. 1992. Fully dynamic planarity testing. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 495-506.
32. GIAMMARRESI, D., AND ITALIANO, G. F. 1996. Dynamic 2- and 3-connectivity on planar graphs. Algorithica 16, 3, 263-287.
33. HARARY, F. 1969. Graph Theory. Addison-Wesley, Reading, Mass.
34. 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 Computer Society Press, Los Alamitos, Calif.
35. 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 Theory of Computing (Las Vegas, Nev., May 27-June 1). ACM, New York, pp. 519-527.
36. HENZINGER, M. R., AND LA POUTRE, J. A. 1995. Certificates and fast algorithms for biconnectivity in fully dynamic graphs. In Proceedings of the 3rd European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 979. Springer-Verlag, New York, pp. 171-184.
37. HOLM, J., DE LICHTENBERG, K., AND THORUP, M. 1997. Polyalgorithmic deterministic fully-dynamic graph algorithms II: 2-edge and biconnectivity. Tech. Rep. DIKU-TR-97/26 (Nov.). Dept. Comput. Sci., Univ. Copenhagen, Copenhagen, Sweden.
38. HOPCROFT, J., AND TARJAN, R. E. 1973. Dividing a graph into triconnected components. SIAM J. Comput. 2, 135-158.
39. HOPCROFT, J., AND TARJAN, R. E. 1974. Efficient planarity testing. J. ACM 21, (Oct.), 549-558.
40. IBARAKI, T., AND KATOH, N. 1983. On-line computation of transitive closure for graphs. Inf. Proc. Lett. 16, 95-97.
41. ITAI, A., AND RODEH, M. 1988. The multi-tree approach to reliability in distributed networks. Inf. Comput. 79, 3-59.
42. ITALIANO, G. F. 1986. Amortized efficiency of a path retrieval data structure. Theor. Comput. Sci. 48, 273-281.
43. ITALIANO, G. F. 1988. Finding paths and deleting edges in directed acrylic graphs. Inf. Proc. Lett. 28, 5-11.
44. 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 on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 798-801.
45. KHANNA, S., MOTWANI, R., AND WILSON, R. H. 1996. On certificates and lookahead on dynamic grain problems. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, Ga., Jan. 28-30). ACM, New York, pp. 222-231.
46. KLEIN, P. N., AND REIF, J. M. 1988. An efficient parallel algorithm for planarity. J. Comput. Syst. Sci. 37, 465-477.
47. KLEIN, P. N., AND SAIRAM, S. 1993. Fully dynamic approximation schemes for shortest path problems in planar graphs. In Proceedings of the 3rd Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 709. Springer-Verlag, Berlin, Germany, pp. 442-451.
48. KURATOWSKI, C. 1930. Sur les problemes des courbes gauches en Topologie. Fund. Math. 16, 217-283.
49. LA POUTRÉ, J. A. 1991. Dynamic graph algorithms and data structures. Ph.D. dissertation. Dept. Comput. Sci., Utrecht Univ.
50. LA POUTRÉ, J. A., AND VAN LEEUWEN, J. 1988. Maintenance of transitive closure and transitive reduction of graphs. In Proceedings of the Workshop on Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 314. Springer-Verlag, Berlin, Germany, pp. 106-120.
51. LEMPEL, A., EVEN, S., AND CEDERBAUM, I. 1967. An algorithm for planarity testing of graphs. In Theory of Graphs: International Symposium (Rome, Italy). Gordon and Breach, New York, pp. 215-232.
52. LIN, C. C., AND CHANG, R. C. 1990. On the dynamic shortest path problem. J. Inf. Proc. 1, 470-476.
53. LIPTON, R. J., AND TARJAN, R. E. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177-189.
54. LIPTON, R. J., AND TARJAN, R. E. 1980. Applications of a planar separator theorem. SIAM J. Comput. 9, 615-627.
55. 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.
56. RAMACHANDRAN, V., AND REIF, J. H. 1989. An optimal parallel algorithm for graph planarity. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 282-287.
57. RAUCH, M. 1994. Improved data structures for fully dynamic biconnectivity. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 686-695.
58. RAUCH, M. H. 1995. Fully dynamic biconnectivity in graphs. Algorithmica 13, 6 (June), 503-538.
59. REIF, J. H. 1987. A topological approach to dynamic graph connectivity. Inf. Proc. Lett. 25, 65-70.
60. ROHNERT, H. 1985. A dynamization of the all pairs least cost path problem. In Proceedings of the 2nd Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 182. Springer-Verlag, Berlin, Germany, pp. 576-590.
61. TAMASSIA, R. 1988. A dynamic data structure for planar graph embedding. In Proceedings of the 15th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 317. Springer-Verlag, Berlin, Germany, pp. 576-590.
62. TAMASSIA, R., AND PREPARATA, F. P. 1990. Dynamic maintenance of planar digraphs, with applications. Algorithmica 5, 509-527.
63. TARJAN, R. E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146-160.
64. THURMIELLA, R. 1989. Techniques for the design of parallel graph algorithms. Ph.D. dissertation. Univ. Texas, Austin, Austin, Tex.
65. TUTTE, W. T. 1966. Connectivity in Graphs. University of Toronto Press, Toronto, Ont., Canada.
66. TUTTE, W. T. 1984. Graph Theory. Cambridge University Press, Cambridge, England.
67. WESTBROOK, J. 1992. Fast incremental planarity testing. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, Germany, pp. 342-353.
68. WESTBROOK, J., AND TARJAN, R. E. 1989. Amortized analysis of algorithms for set union with backtracking. SIAM J. Comput. 18, 1-11.
69. WHITNEY, H. 1930. Non-separable and planar graphs. Trans. Amer. Math Soc. 34, 339-362.