A graph-planarization algorithm and its application to random graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 108 LNCS, Issue , 1981, Pages 95-107

  Ozawa, T ^a   Takahashi, H ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

GRAPH G; GRAPH PLANARIZATION; ITS APPLICATIONS; PLANARITY; PLANARIZATION; RANDOM GRAPHS; SUBGRAPHS; TIME COMPLEXITY;

GRAPH THEORY;

EID: 84948340821     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10704-5_9     Document Type: Conference Paper

References (6)

1. Lempel, A., Even, S. and Cederbaum, I. “An algorithm for planarity testing of graphs,” Theory of Graphs, International Symposium, Rome, July 1966, Rosenstiel, P. edit., pp. 215–232, Gordon & Breach, N. Y., 1967.
2. Booth, K. S., and Lueker, G. S. “Testing for the consecutive ones property, interval graphs and graph planarity using PQ-trees,” J. Computer and Syst. Scie., vol.13, pp. 335–379, 1976.
3. Ozawa, T and Takahashi, H. “An algorithm for planarization of graphs using PQ-trees,” Trans. Information Processing Society of Japan, vol. 22, pp. 9–15, 1981; and also Tech. Report, Inst. Electronics and Communication Engineers of Japan, Circuits and Systems, CAS79-150, Jan. 1980.
4. Chiba, T., Nishioka, I. and Shirakawa, I. “An algorithm of maximal planarization of graphs,” 1979 International Symposium on Circuits and Systems Proc. pp. 649–653, 1979.
5. Garey, M. and Johnson, D.: “Computers and Intractability” W. H. Freeman and Co., Reading, England, 1979.
6. Ozawa, T. and Nishizeki, T. “Properties of certain types of random graphs,” 1979 International Symposium on Circuits and Systems Proc., pp. 88–91, 1979.