On-line planarity testing

SIAM Journal on Computing

Volumn 25, Issue 5, 1996, Pages 956-997

  Di Battista, Giuseppe ^a,c,d   Tamassia, Roberto ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b Brown Univerity   (United States)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d UNIVERSITY OF BASILICATA   (Italy)

Author keywords

Dynamic algorithm; On line algorithm; Planar graph

Indexed keywords

EID: 0000428115     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794280736     Document Type: Article

References (62)

1. B. ALPERN, R. HOOVER, B. ROSEN, P. SWEENEY, AND F. K. ZADECK, Incremental evaluation of computational circuits, in Proc. ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1990, pp. 32-42.
2. G. AUSIELLO, G. F. ITALIANO, A. MARCHETTI-SPACCAMELA, AND U. NANNI, Incremental algorithms for minimal length paths, in Proc. ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1990, pp. 12-21.
3. A. M. BERMAN, M. C. PAULL, AND B. G. RYDER, Proving relative lower bounds for incremental algorithms, Acta Inform., 27 (1990), pp. 665-683.
4. D. BIENSTOCK AND C. L. MONMA, On the complexity of of covering vertices by faces in a planar graph, SIAM J. Comput., 17 (1988), pp. 53-76.
5. K. BOOTH AND G. LUEKER, Testing for the consecutive ones property property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976), pp. 335-379.
6. A. L. BUCHSBAUM, P. C. KANELLAKIS, AND J. S. VITTER, A data structure for arc insertion and regular path finding, in Proc. ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1990, pp. 22-31.
7. J. CAI, X. HAN, AND R. E. TARJAN, An O(m log n)-time algorithm for the maximal subgraph problem, SIAM J. Comput., 22 (1993), pp 1142-1162.
8. N. CHIBA, T. NISHIZEKI, S. ABE, AND T. OZAWA, A linear algorithm for embedding planar graphs using PQ-trees, J. Comput. System Sci., 30 (1985), pp. 54-76.
9. R. F. COHEN AND R. TAMASSIA, Dynamic expression trees and their applications, in Proc. ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1991, pp. 52-61.
10. G. DI BATTISTA AND R. TAMASSIA, Algoritms for plane representations of acyclic digraphs, Theoret. Comput. Sci., 61 (1988), pp. 175-198.
11. _, On-line graphs algorithms with SPQR-trees, in Automata, Languages, and Programming (Proc. 17th International Colloquium on Automata, Languages, and Programming), Lecture Notes in Comput. Sci. 442, Springer-Verlag, Berlin, New York, Heidelberg, 1990, pp. 598-611.
12. _, On-line maintenance of triconnected components with SPQR-trees, Algorithmica, 15 (1996), pp. 302-318.
13. G. DI BATTISTA, R. TAMASSIA, AND I. G. TOLLIS, Area requirement and symmetry display in drawing graphs, in Proc. ACM Symposium on on Computational Geometry, Association for Computing Machinery, New York, 1989, pp. 51-60.
14. P. EADES, L. FOULDS, AND J. GIFFIN, An efficient heuristic for identifying a maximal weight planar subgraph, in Combinatorial Mathematics IX, Lecture Notes in Math. 952, Springer- Verlag, Berlin, New York, Heidelberg, 1990, pp. 239-251.
15. 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), pp. 33-54.
16. S. EVEN AND H. GAZIT, Updating distances in dynamic graphs, Methods Oper. Res., 49 (1985), pp. 371-387.
17. S. EVEN AND Y. SHILOACH, An on-line edge deletion problem, J. Assoc. Comput. Mach., 28 (1981), pp. 1-4.
18. S. EVEN AND R. E. TARJAN, Computing an st-numbering, Theoret. Comput. Sci., 2 (1976), pp. 339-344.
19. H. DE FRAYSSEIX, J. PACH, AND R. POLLACK, Small sets supporting Fary embeddings of planar graphs, in Proc. 20th ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1989, pp. 426-433.
20. H. DE FRAYSSEIX AND P. ROSENSTIEHL, A depth-first-search characterization of planarity, Ann. Discrete Math., 13 (1982), pp. 75-80.
21. G. N. FREDERICKSON, Data structures for on-line updating of minimum spanning trees with applications, SIAM J. Comput., 14 (1985), pp. 781-798.
22. _, Fast algoritms for shortest paths in planar graphs, with applications, SIAM J. Comput., 16 (1987),'pp. 1004-1022.
23. _, Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees, in Proc. 32nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp 632-641.
24. Z. GALIL AND G. F. ITALIANO, Fully dynamic algorithms for edge-connectivity problems, in Proc. 23rd ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1991, pp. 317-327.
25. _, Maintaining biconnected components of dynamic planar graphs, in Automata, Languages, and Programming (Proc. 18th International Colloquium on Automata, Languages, and Programming), Lecture Notes in Comput. Sci. 510, Springer-Verlag, Berlin, New York, Heidelberg, 1991, pp. 339-350.
26. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
27. M. T. GOODRICH AND R. TAMASSIA, Dynamic trees and dynamic point location, in Proc. 23rd ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1991, pp. 523-533.
28. F. HARARY, Graph Theory, Addison-Wesley, Reading, MA, 1969.
29. D. HAREL AND R. E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
30. J. HOPCROFT AND R. E. TARJAN, Dividing a graph into triconnected components, SIAM J. Comput., 2 (1973), pp. 135-158.
31. _, Efficient planarity testing, J. Assoc. Comput. Mach., 21 (1974), pp. 549-568.
32. G. F. ITALIANO, Amortized efficiency of a path retrieval data structure, Theoret. Comput. Sci., 48 (1986), pp. 273-281.
33. _, Finding paths and deleting edges in directed acyclic graphs, Inform. Process. Lett., 28 (1988), pp. 5-11.
34. G. F. ITALIANO, A. MARCHETTI-SPACCAMELA, AND U. NANNI, Dynamic data structures for series-parallel graphs, in Algorithms and Data Structures (Proc. 1989 WADS), Lecture Notes in Comput. Sci. 382, Springer-Verlag, Berlin, New York, Heidelberg, 1989, pp. 352-372.
35. A. KANEVSKY, R. TAMASSIA, J. CHEN, AND G. DI BATTISTA, On-line maintenance of the four-connected components of a graph, in Proc. 32nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 793-801.
36. M.-Y. KAO AND P. N. KLEIN, Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs, in Proc. 22nd ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1990, pp. 181-192.
37. P. N. KLEIN AND J. H. REIF, An efficient parallel algorithm for planarity, J. Comput. System Sci., 37 (1988), pp. 190-246.
38. A. LEMPEL, S. EVEN, AND I. CEDERDAUM, An algorithm for planarity testing of graphs, in Theory of Graphs, International Symposium, Gordon and Breach, New York, 1967, pp. 215-232.
39. C. C. LIN AND R. C. CHANG, On the dynamic shortest path problem, in Proc. International Workshop on Discrete Algorithms and Complexity, 1989, pp. 203-212.
40. T. NISHIZEKI AND N. CHIBA, Planar Graphs: Theory and Algorithms, Ann. Discrete Math. 32, North-Holland, Amsterdam, 1988.
41. T. OZAWA AND H. TAKAHASHI, A graph-planarization algorithm and its applications to random graphs, in Graph Theory and Algorithms, Lecture Notes in Comput. Sci. 108, Springer-Verlag, Berlin, New York, Heidelberg, 1981, pp. 95-107.
42. J. A. LA POUTRÉ, Dynamic graph algorithms and data structures, Ph.D. thesis, Department of Computer Science, University of Utrecht, Utrecht, The Netherlands, 1991.
43. J. A. LA POUTRÉ AND J. VAN LEEUWEN, Maintenance of transitive closures and transitive reductions of graphs, in Graph-Theoretic Concepts in Computer Science (Proc. 1987 WG), Lecture Notes in Comput. Sci. 314, Springer-Verlag, Berlin, New York, Heidelberg, 1988, pp. 106-120.
44. F. P. PREPARATA AND R. TAMASSIA, Fully dynamic point location in a monotone subdivision, SIAM J. Comput., 18 (1989), pp. 811-830.
45. _, Efficient point location in a convex spatial cell complex, SIAM J. Comput., 21 (1992), pp. 267-280.
46. V. RAMACHANDRAN AND J. H. REIF, An optimal parallel algorithm for graph planarity, in Proc. 30th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 282-293.
47. J. H. REIF, A topological approach to dynamic graph connectivity, Inform. Process. Lett., 25 (1987), pp. 65-70.
48. H. ROHNERT, A dynamization of the all-pairs least cost problem, in Proc. 1985 Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 182, Springer- Verlag, Berlin, New York, Heidelberg, 1985, pp. 279-286.
49. P. ROSENSTIEHL, personal communication.
50. B. SCHIEBER AND U. VISHKIN, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput., 17 (1988), pp. 1253-1262.
51. W. SCHNYDER, Embedding planar graphs on the grid, in Proc. ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1990, pp. 138-148.
52. D. D. SLEATOR AND R. E. TARJAN, A data structure for dynamic trees, J. Comput. System Sci., 24 (1983), pp. 362-381.
53. R. TAMASSIA. A dynamic data structure for planar graph embedding, in Automata, Languages, and Programming (Proc. 15th International Colloquium on Automata, Languages, and Programming), Lecture Notes in Comput. Sci. 317, Springer-Verlag, Berlin, New York, Heidelberg, 1988, pp. 576-590.
54. R. TAMASSIA AND F. P. PREPARATA, Dynamic, maintenance of planar digraphs, with applications, Algorithmica, 5 (1990), pp. 509-527.
55. R. TAMASSIA AND I. G. TOLLIS, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom., 1 (1986), pp. 321-341.
56. _, Dynamic reachability in planar digraphs with one source and one sink, Theoret. Comput. Sci., 119 (1993), pp. 331-343.
57. R. TAMASSIA AND J. S. VITTER, Parallel transitive closure and point location in planar structures, SIAM J. Comput., 20 (1991), pp. 708-725.
58. R. E. TARJAN AND J. VAN LEEUWEN, Worst-case analysis of set-union algorithms, J. Assoc. Comput. Mach., 31 (1984), pp. 245-281.
59. R. E. TARJAN AND A. C.-C. YAO, Storing a sparse table, Comm. Assoc. Comput. Mach., 22 (1979), pp. 606-611.
60. J. WESTBROOK AND R. E. TARJAN, Maintaining bridge-connected and biconnected components on-line, Algorithmica, 7 (1992), pp. 433-464.
61. H. WHITNEY, Non-separable and planar graphs, Trans. Amer. Math. Soc., 34 (1932), pp. 339-362.
62. M. YANNAKAKIS, Four pages are necessary and sufficient for planar graphs, in Proc. 18th ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1986, pp. 104-108.