The Complexity of Planarity Testing

Authors:
Eric Allender;Meena Mahajan
Affiliations:
-;-
Venue:
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2000

Citing 17
Cited 3

Problems complete for deterministic logarithmic space

Journal of Algorithms
Parallel ear decomposition search (EDS) and st-numbering in graphs

Theoretical Computer Science
The method of forced enumeration for nondeterministic automata

Acta Informatica
Nondeterministic space is closed under complementation

SIAM Journal on Computing
Planarity testing in parallel

Proceedings of the 30th IEEE symposium on Foundations of computer science
Boolean complexity classes vs. their arithmetic analogs

Proceedings of the seventh international conference on Random structures and algorithms
Counting quantifiers, successor relations, and logarithmic space

Journal of Computer and System Sciences - special issue on complexity theory
SL ⊆L4/3

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient Planarity Testing

Journal of the ACM (JACM)
Symmetric Complementation

Journal of the ACM (JACM)
Randomization and Derandomization in Space-Bounded Computation

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Making nondeterminism unambiguous

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Random walks, universal traversal sequences, and the complexity of maze problems

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Undirected connectivity in O(log/sup 1.5/n) space

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
A combinatorial algorithm for Pfaffians

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Paths Problems in Symmetric Logarithmic Space

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Space Efficient Algorithms for Series-Parallel Graphs

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Planarity testing revisited

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL [25]. The upper bound of SL matches the lower bound of L in the context of (nonuniform) circuit complexity, since L/poly is equal to SL/poly. Similarly, we show that a planar embedding, when one exists, can be found in FLSL. Previously, these problems were known to reside in the complexity class AC1, via a O(log n) time CRCW PRAM algorithm [22], although planarity checking for degree-three graphs had been shown to be in SL [23, 20].