The following pages link to (Q4727444):
Displaying 3 items.
- Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
- Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case (Q2947545) (← links)
- New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. (Q2978548) (← links)