Abstract

. Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. Polynomial algorithms have been obtained by Jakayumar, Thulasiraman and Swamy [6] and Wu [9]. O(mlogn) algorithms were previously given by Di Battista and Tamassia [3] and Cai, Han and Tarjan [2]. A recent O(m a a a a a a a a a a a a a a a a a a a a a a a a a (n)) algorithm was obtained by La Poute [7]. Our algorithm is based on a simple planarity test [5] developed by the author, which is a vertex addition algorithm based on a depth-first-search ordering. The planarity test [5] uses no complicated data structure and is conceptually simpler than Hopcroft and Tarjan's path addition and Lempel, Even and Cederbaum's vertex addition approaches. 1 1. Introduction Given an undirected graph, the planarity testing problem is to determine whether there exists a clockwise edge ordering around each vertex such that t...

Citations

406	G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-trees - Booth, Lueker - 1976
193	Tarjan, Efficient planarity testing - Hopcroft, E - 1974
102	A linear algorithm for embedding planar graphs using PQ-trees - Chiba, Nishizeki, et al. - 1985
74	Incremental planarity testing - Battista, Tamassia - 1989
29	Depth-first search and Kuratowski subgraphs - Williamson - 1984
28	1984], Graph algorithms and NPcompleteness - Mehlhorn
28	1994], On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm - Mehlhorn, Mutzel
25	O(n ) algorithms for graph planarization - Jayakumar, Thulasiraman, et al. - 1989
17	An O(n2) maximal planarization algorithm based on PQ-trees - Kant - 1992
7	A simple test for planar graphs - Hsu, Shih - 1993
7	Lempel An algorithm for planarity testing of graphs, in: Theory of graphs - Cederbaum, Even, et al. - 1967
6	On the Planar Imbedding of Linear Graphs - Wu - 1985
5	1993], A simple lineartime algorithm for embedding maximal planar graphs - Stamm-Wilbrandt
4	An O(mlogn)-time algorithm for the maximal planar subgraph problem. Unpublished manuscript - Cai, Han, et al. - 1991
4	Cederbaum [1967], An algorithm for planarity testing of graphs, Theory of Graphs - Lempel, Even, et al.
4	1993], A unified approach of testing, embedding and drawing planar graphs - Small
3	Lueker [1976], Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms - Booth, S
3	1999], Stop minding your P’s and Q’s: A simplified O(n) embedding algorithm - Boyer, Myvold - 1999
3	Tarjan [1993], An O(mlogn)-time algorithm for the maximal planar subgraph problem - Cai, Han, et al.
3	Tarjan [1974], Efficient planarity testing - Hopcroft, E
3	O(n2) algorithms for graph planarization - Jayakumar, Thulasiraman, et al. - 1989
3	A note on computing a maximal planar subgraph using PQ-trees - Junger, Leipert, et al. - 1998
2	PQ Trees, PC Trees and Planar Graphs, a book chapter - Hsu, McConnell - 2004
1	La Poute, Alpha-Algorithms for incremental planarity testing, STOC - A - 1994
1	A Linear Algorithm for the Maximal Planar Subgraph Problem - Hristo - 1995
1	1995], "Finding maximal planar subgraphs in linear time - Hsu
1	PC-trees vs. PQ-trees,” invited talk, Workshop on Graph Structures and Algorithms, also appeared - Hsu
1	Hsu [1993], "A simple test for planar graphs - Shih, L
1	Hsu [1999], A new planarity test, Theoretical Computer Science 223 - Shih, L
1	1997], Planarity in linear time – Lecture Notes - Thomas