# A sublinear space, polynomial time algorithm for directed s-t connectivity

@article{Barnes1992ASS,
title={A sublinear space, polynomial time algorithm for directed s-t connectivity},
author={Greg Barnes and Jonathan F. Buss and Walter L. Ruzzo and Baruch Schieber},
journal={[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference},
year={1992},
pages={27-33}
}
• Published 22 June 1992
• Computer Science, Mathematics
• [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
A deterministic sublinear space, polynomial-time algorithm for directed s-t connectivity, which is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph, is presented. For n-vertex graphs, the algorithm can use as little as n/2/sup Theta /( square root log n) space while still running in polynomial time.<<ETX>>

### Undirecteds-t connectivity in polynomial time and sublinear space

• Computer Science
computational complexity
• 2005
This paper presents the first known deterministic algorithms solving undirecteds-t connectivity using sublinear space and polynomial time, and provides a nearly smooth time-space tradeoff between depth-first search and Savitch's algorithm.

### Relating Sublinear Space Computability Among Graph Connectivity and Related Problems

• Computer Science, Mathematics
SOFSEM
• 2016
Algorithmic techniques are demonstrated to relate the sublinear-space computability of directed graph connectivity and undirected graph length bounded connectivity and the number n of vertices w.r.t. the number of vertice.

### Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability

• Mathematics
MFCS
• 2014
The main result of this paper is to show that the directed graph reachability problem restricted to planar graphs can be solved in polynomial time using only $$\widetilde{O}(\sqrt{n})$$ space.

### Time-Space Tradeoffs For Undirected st-Connectivity on a Graph Automata

Any probabilistic jumping automaton for graphs (JAG) requires either space $\Omega( \log^2 n /\log log n )$ or time $n^{(1 + \Omega ( 1 / \log \log n )) }$ to solve undirected st-connectivity.

### An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs

• Mathematics
ISAAC
• 2015
It is shown that reachability in directed layered planar graphs can be decided in polynomial time and O(nε) space, for any ε > 0.

### Space-efficient Basic Graph Algorithms

• Computer Science
STACS
• 2015
We reconsider basic algorithmic graph problems in a setting where an n-vertex input graph is read-only and the computation must take place in a working memory of O(n) bits or little more than that.

### STCON in Directed Unique-Path Graphs

• Mathematics, Computer Science
FSTTCS
• 2008
The results may be viewed along the continuum of sublinear-space polynomial-time algorithms for STCON in different classes of directed graphs - from slightly sub linear-space algorithms for general graphs to O(\log n) space algorithms for trees.

### Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs

• Mathematics, Computer Science
ITCS
• 2020
A reduction is given that connects the running time of undirected 2k-cycle to finding directed odd cycles, s-t connectivity in directed graphs, and Max-3-SAT, and a space-efficient algorithms and conditional time lower bounds for finding cycles and walks in graphs are considered.

### Time-space trade-offs for undirected st-connectivity on a JAG

For every constant z z O, the expected time to solve undirected sr-connectivity on a probabilistic JAG with p ~ & & pebbles and q < n’”< n states isn x ZQ(*J when theinputgraph is chosen unifortnly from a family of 3-regular graphs.

### Randomized Time-Space Tradeoffs for Directed Graph Connectivity

• Computer Science
FSTTCS
• 2003
This work uses a strategy parameterized by a parameter k that uses k pebbles and performs short random walks of length 1 using a probabilistic counter to get a family of algorithms that ranges between log2 n and log n in space and 2$$^{{\rm log^2}n}$$ and n n in running time.

## References

SHOWING 1-10 OF 14 REFERENCES

### Undirected connectivity in O(log/sup 1.5/n) space

• Computer Science
Proceedings., 33rd Annual Symposium on Foundations of Computer Science
• 1992
The authors present a deterministic algorithm for the connectivity problem on undirected graphs that runs in O(log/sup 1.5/n) space. Thus, the recursive doubling technique of Savich (1970) which

### Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.

• Computer Science
STOC '91
• 1991
A process for preparing a B30-threonine-insulin which comprising reacting a des-B30-insulin with an excess amount of threonine derivative in the presence of an enzyme specifically acting on the

### Time-space lower bounds for directed s-t connectivity on JAG models

• Computer Science
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
• 1993
A time-space lower bound is proved of ST=/spl Omega/(n/sup 2//log n) and S/sup 1/2/T /spl Omega/spl Omega for Cook and Rackoff's JAG model (1980), where n is the number of vertices and m the numberof edges in the input graph.

### RL⊆SC

• N. Nisan
• Computer Science, Mathematics
STOC '92
• 1992
There exists a deterministic algorithm for the undirected connectivity problem that runs in polynomial time and 0(log2 n) space, obtained by derandomizing the randomized algorithm of [AKL*79], and the de-randomization result is obtained.

### Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations

• M. Tompa
• Computer Science, Mathematics
STOC '80
• 1980
This is the first demonstration of a “natural” algorithm which has a polynomial time implementation and has a small (e.g., O(log2n) space) space implementation, but has no implementation running in polynometric time and small space simultaneously.

### Space bounds for graph connectivity problems on node-named JAGs and node-ordered JAGs

• C. Poon
• Computer Science
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
• 1993
A space lower bound of /spl Omega/(log/sup 2/ n/log log n) is proved for the problem of directed st-connectivity on a probabilistic NN-JAG and a space upper bound of O(log n), which is shown to be nearly as powerful as a nondeterministic Turing machine.

### Deterministic CFL's are accepted simultaneously in polynomial time and log squared space

It is proposed that PLOSS be the class of sets recognizable on a deterministic Turing machine simultaneously in polynomial time and log squared space and the theorem in the title is proved.

### The Complexity of Graph Connectivity

The major developments in understanding the complexity of the graph connectivity problem in several computational models are surveyed, and some challenging open problems are highlighted.

### Space Lower Bounds for Maze Threadability on Restricted Machines

• Computer Science
SIAM J. Comput.
• 1980
It is proved that for every N there is a JAG which can determine threadability of an arbitrary N node input graph in storage $O((log N)^2 )$, where the storage of a J AG with Ppebbles and N states is defined to be $P\log N + \log Q$.