A note on computing a maximal planar subgraph using PQ-trees

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 17, Issue 7, 1998, Pages 609-612

  Jünger, Michael ^a   Leipert, Sebastian ^a   Mutzel, Petra ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

Maximal planar subgraphs; Planarization; PQ trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGRATED CIRCUIT LAYOUT; PROBLEM SOLVING; TREES (MATHEMATICS); VLSI CIRCUITS;

MAXIMAL PLANAR SUBGRAPH; PLANARIZATION; PQ TREES;

GRAPH THEORY;

EID: 0032115071     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.709399     Document Type: Article

References (16)

1. K. S. Booth and G. S. Lueker, "Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms," J. Comput. Syst. Sci, vol. 13, pp. 335-379, 1976.
2. J. Cai, X. Han, and R. E. Tarjan, "An O(mlog n)-time algorithm for the maximal planar subgraph problem," SIAM J. Comput., vol. 22, pp. 1142-1162, 1993.
3. T. Chiba, I. Nishioka, and I. Shirakawa, "An algorithm for maximal planarization of graphs," in Proc. 1979 IEEE Int. Symp. Circuits Syst., 1979, pp. 336-441.
4. G. Di Battista and R. Tamassia, "Incremental planarity testing," in Proc. 30th Annu. IEEE Symp. Foundations Comput. Sci, 1989, pp. 436-441.
5. S. Even, Graph Algorithms. Potomac, MD: Computer Science Press, 1979.
6. S. Even and R. E. Tarjan, "Computing an si-numbering," Theoretical Comput. Sci, vol. 2, pp. 339-344, 1976.
7. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory ofNP-Completeness. San Francisco, CA: Freeman, 1979.
8. F. Harary, Graph Theory. Reading, MA: Addison Wesley, 1969.
9. R. Jayakumar, K. Thulasiraman, and M. N. S. Swamy, "On maximal planarization of nonplanar graphs," IEEE Trans. Circuits Syst., vol. 33, pp. 843-844, 1986.
10. "On O(n2) algorithms for graph planarization," IEEE Trans. Comput.-Aided Design, vol. 8, pp. 257-267, Mar. 1989.
11. M. Jünger, S. Leipert, and P. Mutzel, "On computing a maximal planar subgraph using PQ-trees," Institut für Informatik, Universität zu Köln, Germany, Tech. Rep. 96.227, 1996.
12. G. Kant, "An O(n2) maximal planarization algorithm based on PQ-trees," Dept. Comput. Sci, Utrecht Univ., The Netherlands, Tech. Rep. RUU-CS-92-03, 1992.
13. S. Leipert, "Berechnung maximal planarer Untergraphen mit Hilfe von PQ-Bäumen," Master's thesis, Institut für Informatik der Universität zu Köln, Germany, 1995.
14. A. Lempel, S. Even, and I. Cederbaum, "An algorithm for planarity testing of graphs," in Theory of Graphs: Int. Symp.: Rome, Italy, July 1966, pp. 215-232.
15. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. New York: Wiley, 1990.
16. T. Ozawa and H. Takahashi, "A graph-planarization algorithm and its application to random graphs," in Graph Theory and Algorithms, vol. 108 of Lecture Notes in Computer Science, pp. 95-107, 1981.