Pages that link to "Item:Q677988"

The following pages link to Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988):

Displaying 11 items.

• Time-space tradeoffs for undirected graph traversal by graph automata (Q675049) (← links)
• RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\) (Q1271273) (← links)
• A fast randomized LOGSPACE algorithm for graph connectivity (Q1349893) (← links)
• A spectrum of time-space trade-offs for undirected \(s-t\) connectivity (Q1356886) (← links)
• Parameterized graph connectivity and polynomial-time sub-linear-space short reductions (preliminary report) (Q1685795) (← links)
• Relating Sublinear Space Computability Among Graph Connectivity and Related Problems (Q2794336) (← links)
• STCON in Directed Unique-Path Graphs (Q3165964) (← links)
• Undirected ST-connectivity in log-space (Q3581436) (← links)
• Undirected connectivity in \(O(\log^{1. 5} n)\) space (Q4230323) (← links)
• An <i>O</i> (log( <i>n</i> ) ^4/3 ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs (Q5385338) (← links)
• StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) (Q6487439) (← links)