Pages that link to "Item:Q2821694"
From MaRDI portal
The following pages link to Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs (Q2821694):
Displaying 7 items.
- On the complexity of directed intersection representation of DAGs (Q2019504) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case (Q2947545) (← links)
- An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q3459899) (← links)
- An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q4973896) (← links)
- Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)