Topological graph theory
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Embeddings of graphs with no short noncontractible cycles
Journal of Combinatorial Theory Series B
On truth-table reducibility to SAT
Information and Computation
The relative power of logspace and polynomial time reductions
Computational Complexity
Counting quantifiers, successor relations, and logarithmic space
Journal of Computer and System Sciences - special issue on complexity theory
Isolation, matching and counting uniform and nonuniform upper bounds
Journal of Computer and System Sciences
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Making Nondeterminism Unambiguous
SIAM Journal on Computing
An Unambiguous Class Possessing a Complete Set
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Searching Constant Width Mazes Captures the AC0 Hierarchy
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Space Efficient Algorithms for Series-Parallel Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Symmetric Logspace is Closed Under Complement
Symmetric Logspace is Closed Under Complement
The complexity of planarity testing
Information and Computation
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the power of the compass (or, why mazes are easier to search than graphs)
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
The Planar k-Means Problem is NP-Hard
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
On the Complexity of Sandpile Prediction Problems
Electronic Notes in Theoretical Computer Science (ENTCS)
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Reachability In K3,3-free graphs and K5-free graphs is in unambiguous log-space
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Longest paths in planar DAGs in unambiguous logspace
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
On the Power of Isolation in Planar Graphs
ACM Transactions on Computation Theory (TOCT)
One-input-face MPCVP is hard for l, but in LogDCFL
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
The planar k-means problem is NP-hard
Theoretical Computer Science
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is logspace-reducible to its complement, and we show that the problem of searching graphs of genus 1 reduces to the planar case. We also consider a previously-studied subclass of planar graphs known as grid graphs. We show that the directed planar s-t-connectivity problem reduces to the reachability problem for directed grid graphs. A special case of the grid-graph reachability problem where no edges are directed from right to left is known as the “layered grid graph reachability problem”. We show that this problem lies in the complexity class UL.