Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
AlgorithmBipolar orientationBook embeddingColin de Verdière graph invariant

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Finding All Maximal Subsequences with Hereditary Properties
Consider a sequence s_1,...,s_n of points in the plane. We want to find all maximal subsequences with a given hereditary property… 
2012
2012
A Planarity Test via Construction Sequences
Linear-time algorithms for testing the planarity of a graph are well known for over 35 years. However, these algorithms are quite… 
2004
2004
On finding an ear decomposition of an undirected graph distributively
2004
2004
Operations on Sets of Conserved Intervals
Conserved intervals were introduced as a measure of similarity between genomes whose genes have been shuffled during evolution by… 
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
1992
1992
Fully dynamic planarity testing (extended abstract)
The fully dynamic planarity testing problem consists of performing an arbitrary sequence of the following three kinds of… 
Review
1987
Review
1987
Parallel Algorithms for Some Computational Problems
1987
1987
An Algorithm for Testing Planarity of Hierarchical Graphs
An algorithm for k-line planarity testing of hierarchical graphs is described. If the graph is k-line planar the algorithm… 
Highly Cited
1982
Highly Cited
1982
Parallel Algorithms in Graph Theory: Planarity Testing
We present efficient $(O(\log ^2 n))$ parallel algorithms for two classical graph problems: planarity testing and finding… 
1971
1971
Planarity Testing in V log V Steps: Extended Abstract
An efficient algorithm is presented for determining whether or not a given graph is planar. If V is the number of vertices in the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)