Pages that link to "Item:Q2947541"
From MaRDI portal
The following pages link to Directed Planar Reachability Is in Unambiguous Log-Space (Q2947541):
Displayed 20 items.
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- Green's theorem and isolation in planar graphs (Q714498) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
- On the power of unambiguity in log-space (Q1926109) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs (Q2821694) (← links)
- Planarity Testing Revisited (Q3010433) (← links)
- (Q5002753) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- (Q5115772) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata (Q6173104) (← links)