Pages that link to "Item:Q4973896"
From MaRDI portal
The following pages link to An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q4973896):
Displaying 7 items.
- $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (Q2922595) (← 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)
- An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q3459899) (← links)
- (Q5875652) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388) (← links)
