scientific article; zbMATH DE number 1500509
From MaRDI portal
Publication:4501524
zbMATH Open0959.68048MaRDI QIDQ4501524FDOQ4501524
Authors: Meena Mahajan, Eric Allender 
Publication date: 26 April 2001
Title of this publication is not available (Why is that?)
Recommendations
- The complexity of planarity testing
- Planarity testing revisited
- On the computational complexity of upward and rectilinear planarity testing
- scientific article; zbMATH DE number 6863595
- On the complexity of HV-rectilinear planarity testing
- The Complexity of Planar Counting Problems
- Computing planarity in computable planar graphs
- On the linearity of testing planarity of graphs
- Hierarchical planarity testing algorithms
- scientific article; zbMATH DE number 3960992
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (16)
- Classification and detection of obstructions to planarity
- Testing approximate symmetry in the plane is NP-hard
- Title not available (Why is that?)
- Fully-dynamic planarity testing in polylogarithmic time
- The complexity of oblivious plans for orienting and distinguishing polygonal parts
- Testing Full Outer-2-planarity in Linear Time
- Testing contractibility in planar rips complexes
- Space complexity: what makes planar graphs special?
- Title not available (Why is that?)
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- The complexity of planarity testing
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
- A Planarity Test via Construction Sequences
- Planarity testing revisited
- On the computational complexity of upward and rectilinear planarity testing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501524)
