Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,004,783 papers from all fields of science
Search
Sign In
Create Free Account
Planarity testing
Known as:
Graph planarity
In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Algorithm
Bipolar orientation
Book embedding
Colin de Verdière graph invariant
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
On $K_5$ and $K_{3,3}$-minors of graphs and regular matroids
J. P. Costalonga
2013
Corpus ID: 117960558
In this paper we prove two main results about obstruction to graph planarity. One is that, if $G$ is a 3-connected graph with a…
Expand
2010
2010
Dummy fill effect on CMP planarity
周隽雄
,
陈岚
,
阮文彪
,
李志刚
,
沈伟翔
,
叶甜春
2010
Corpus ID: 137050328
2007
2007
Cyclic Level Planarity Testing and Embedding (Extended Abstract)
C. Bachmaier
,
Wolfgang Brunner
,
Christof König
2007
Corpus ID: 126183092
In this paper we introduce cyclic level planar graphs, which are a planar version of the recurrent hierarchies from Sugiyama et…
Expand
2006
2006
A Linear-time Algorithm for Finding a Maximal Planar Subgraph *
H. Djidjev
2006
Corpus ID: 12789644
We construct an optimal linear-time algorithm for the maximal planar subgraph problem: given a graph G, find a planar subgraph G…
Expand
2003
2003
A New Parallel Algorithm for Planarity Testing
David A. Bader
,
Sukanya Sreshta
2003
Corpus ID: 59667126
This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach…
Expand
2003
2003
Planarity testing for graphs represented by a rotation scheme
Andrea Donafee
,
C. Maple
Proceedings on Seventh International Conference…
2003
Corpus ID: 5525881
Many algorithms exist to determine if a given graph can be embedded in a plane [G. Di Battistia et al., (1994)]. The majority of…
Expand
2003
2003
A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs
H. Chan
2003
Corpus ID: 1893742
We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point…
Expand
2001
2001
I/O-Efficient Planar Separators and Applications
N. Zeh
2001
Corpus ID: 1813534
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs…
Expand
1987
1987
An Algorithm for Testing Planarity of Hierarchical Graphs
G. Battista
,
E. Nardelli
International Workshop on Graph-Theoretic…
1987
Corpus ID: 26291893
An algorithm for k-line planarity testing of hierarchical graphs is described. If the graph is k-line planar the algorithm…
Expand
1971
1971
Planarity Testing in V log V Steps: Extended Abstract
J. Hopcroft
,
R. Tarjan
IFIP Congress
1971
Corpus ID: 11170000
An efficient algorithm is presented for determining whether or not a given graph is planar. If V is the number of vertices in the…
Expand