MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The complexity of planarity testing." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

The Complexity of Planarity Testing
by Eric Allender, Meena Mahajan — 2000
…The complexity of planarity testing Eric Allender #1 and Meena Mahajan ##2 1 Dept. of Computer…
Cited by 14 (6 self) – Add To MetaCart

R.: Space efficient algorithms for directed series-parallel graphs
by Andreas Jakoby, Rüdiger Reischuk — 2006 — Journal of Algorithms
… step in classifying the computational complexity of planarity testing showing that this problem is hard…
Cited by 1 (0 self) – Add To MetaCart

Space Efficient Algorithms for Series-Parallel Graphs
by Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk — 2001 — In 18th International Symposium on Theoretical Aspects of Computer Science (STACS), number 2010 in Lecture Notes in Computer Science
… determine the computational complexity of a nontrivial subproblem of planarity testing precisely. For series…
Cited by 6 (1 self) – Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB