Pages that link to "Item:Q4210095"
From MaRDI portal
The following pages link to A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity (Q4210095):
Displaying 22 items.
- Homomorphisms to oriented paths (Q1336655) (← links)
- A space lower bound for \(st\)-connectivity on node-named JAGs (Q1566733) (← links)
- 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)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs (Q2821694) (← links)
- Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
- Directed st-Connectivity Is Not Expressible in Symmetric Datalog (Q3519500) (← links)
- Undirected ST-connectivity in log-space (Q3581436) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- The complexity of graph connectivity (Q5096823) (← links)
- (Q5115772) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- An <i>O</i> (log( <i>n</i> ) <sup>4/3</sup> ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs (Q5385338) (← links)
- State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q6098146) (← links)
- Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388) (← links)