A new planarity test

Theoretical Computer Science

Volumn 223, Issue 1-2, 1999, Pages 179-191

  Shih, Wei Kuan ^a   Hsu, Wen Lian ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013130829     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(98)00120-0     Document Type: Article

References (10)

1. K.S. Booth, G.S. Lueker, Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13 (1976) 335-379.
2. J. Cai, X. Han, R.E. Tarjan, An O(m log n)-time algorithm for the maximal planar subgraph problem, SIAM J. Comput. 22 (1993) 1142-1162.
3. N. Chiba, T. Nishizeki, S. Abe, T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, J. Comput. System Sci. 30 (1985) 54-76.
4. J.E. Hopcroft, R.E. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach. 21 (1974) 549-568.
5. A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of graphs, in: P. Rosenstiehl (Ed.), Theory of Graphs, Gordon and Breach, New York, pp. 215-232.
6. K. Mehlhorn, Graph algorithms and NP-completeness, Data Struct. Algor. 2 (1984) 93-122.
7. K. Mehlhorn, P. Mutzel, On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm, to appear in Algorithmica; Technical Report MPI-I-94-117, Max-Planck-Institute f. Informatik, Saarbrucken, 1994.
8. J. Small, A unified approach of testing, embedding and drawing planar graphs, Proc. ALCOM Internat. Workshop on Graph Drawing, Sevre, France, 1993.
9. H. Stamm-Wilbrandt, A simple linear-time algorithm for embedding maximal planar graphs, Proc. ALCOM Internat. Workshop on Graph Drawing, Sere, France, 1993.
10. S.G. Williamson, Depth-first search and Kuratowski subgraphs, J. ACM 31 (1984) 681-693.