Pages that link to "Item:Q6039899"
From MaRDI portal
The following pages link to Space-efficient algorithms for reachability in directed geometric graphs (Q6039899):
Displaying 9 items.
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q3459899) (← links)
- Efficient Algorithms for Geometric Graph Search Problems (Q3719850) (← links)
- (Q4553236) (← 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)
- (Q5875652) (← links)
- O'Reach: Even Faster Reachability in Large Graphs (Q6159900) (← links)
- Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388) (← links)