On Maximal Planarization of Nonplanar Graphs

IEEE Transactions on Circuits and Systems

Volumn 33, Issue 8, 1986, Pages 843-844

  Thulasiraman, K ^a   Jayakumar, R ^a   Swamy, M N S ^a  

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

LEMPEL, EVEN AND CEDERBAUM (LFC) ALGORITHM; MAXIMAL PLANARIZATION OF NONPLANAR GRAPH; OZAWA AND TAKAHASHI ALGORITHM; PQ-TREES;

MATHEMATICAL TECHNIQUES;

EID: 0022768092     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1986.1085997     Document Type: Article

References (6)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.
2. T. Chiba, I. Nishioka, and I. Shirakawa, “An algorithm of maximal planarization of graphs,” in Proc. 1979 IEEE Int. Symp. Circuits Syst., pp. 649–652.
3. J. Hopcroft and R. Tarjan “Efficient planarity testing,” J. Ass. Comput. Mach., vol. 21, no. 4, pp. 549–568, Oct. 1974.
4. T. Ozawa and H. Takahashi, “A graph-planarization algorithm and its application to random graphs,” in Graph Theory and Algorithms (Springer-Verlag Lecture Notes in Computer Science, vol. 108), 1981, pp. 95–107.
5. K. S. Booth and G. S. Lueker “Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms,” J. Comp. Syst. Sci., vol. 13, no. 3, pp. 335–379, Dec. 1976.
6. S. Even, Graph Algorithms. Potomac, MD: Computer Science Press, 1979.