NC algorithms for computing the number of perfect matchings in K3,3-free graph and related problems
Information and Computation
Making Nondeterminism Unambiguous
SIAM Journal on Computing
Parallel Algorithms for $K_{5}$-minor Free Graphs
Parallel Algorithms for $K_{5}$-minor Free Graphs
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Directed Planar Reachability is in Unambiguous Log-Space
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Longest paths in planar DAGs in unambiguous logspace
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
Computational Complexity
| Hi-index | 0.00 |
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL ∩ coUL. This significantly extends the result of Bourke, Tewari, and Vinodchandran that the reachability problem for directed planar graphs is in UL ∩ coUL.