Pages that link to "Item:Q2922595"

The following pages link to $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (Q2922595):

Displaying 16 items.

• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
• Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
• Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
• Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
• Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← 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)
• Reachability in a Planar Subdivision with Direction Constraints (Q4580090) (← links)
• An <i>O</i> ( <i>n</i> ^ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q4973896) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• (Q5115772) (← 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)