Affordable Access

A Planarity Test via Construction Sequences

Authors
  • Schmidt, Jens M.
Type
Preprint
Publication Date
Feb 22, 2012
Submission Date
Feb 22, 2012
Identifiers
arXiv ID: 1202.5003
Source
arXiv
License
Yellow
External links

Abstract

Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests. We give a simple reduction from planarity testing to the problem of computing a certain construction of a 3-connected graph. The approach is different from previous planarity tests; as key concept, we maintain a planar embedding that is 3-connected at each point in time. The algorithm runs in linear time and computes a planar embedding if the input graph is planar and a Kuratowski-subdivision otherwise.

Report this publication

Statistics

Seen <100 times