Pages that link to "Item:Q2947545"
From MaRDI portal
The following pages link to Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case (Q2947545):
Displaying 8 items.
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- On the power of unambiguity in log-space (Q1926109) (← links)
- New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. (Q2978548) (← links)
- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace (Q3191145) (← links)
- (Q4727444) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)