The Complexity of Planarity Testing (2000)

by Eric Allender , Meena Mahajan
Citations:23 - 7 self

Documents Related by Co-Citation

143 Undirected st-connectivity in log-space – O Reingold - 2005
18 The directed planar reachability problem – Eric Allender, Samir Datta, Sambuddha Roy - 2005
51 Counting Quantifiers, Successor Relations, and Logarithmic Space – Kousha Etessami
37 Making Nondeterminism Unambiguous – Klaus Reinhardt, Eric Allender - 1997
49 A very hard log-space counting class – C Àlvarez, B Jenner - 1993
30 Planarity testing in parallel – V Ramachandran, J Reif - 1994
22 Searching Constant Width Mazes Captures the AC° Hierarchy – David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum - 1997
12 Grid Graph Reachability Problems – Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy - 2006
16 An NC algorithm for evaluating monotone planar circuits – A L Delcher, S R Kosaraju - 1995
10 An NC algorithm for the general planar monotone circuit value problem – H Yang - 1991
7 A logspace algorithm for partial 2-tree canonization – V Arvind, B Das, J Köbler - 2008
15 Complexity Theory of Parallel Time and Hardware – P W Dymond, S A Cook - 1989
13 A space efficient algorithm for the monotone planar circuit value problem – L M Goldschlager - 1980
7 On the parallel evaluation of classes of circuits – S R Kosaraju - 1990
48 The monotone and planar circuit value problems are log-space complete for P, SIGACT News 9:2 – L Goldschlager - 1977
8 THE ISOMORPHISM PROBLEM FOR PLANAR 3-CONNECTED GRAPHS IS IN UNAMBIGUOUS LOGSPACE – Thomas Thierauf, Fabian Wagner - 2008
22 Isolation, Matching, and Counting: Uniform and Nonuniform Upper Bounds – Eric Allender, Klaus Reinhardt, Shiyu Zhon - 1998
15 Directed planar reachability is in unambiguous logspace – Chris Bourke, Raghunath Tewari, N. V. Vinodchandran - 2007
10 Evaluating monotone circuits on cylinders, planes, and torii – Nutan Limaye, Meena Mahajan, Jayalal Sarma M. N - 2006