An O(Iog(n)4/3) Space Algorithm for (s, t) Connectivity in Undirected Graphs

Roy Armoni; Amnon Ta-Shma; Avi Wigderson; Shiyu Zhou

doi:10.1145/333979.333984

An O(Iog(n)^4/3) Space Algorithm for (s, t) Connectivity in Undirected Graphs

Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(Iog^4/3 n) space. This improves the previous O(log^3/2 n) bound of Nisan et al. [1992].

Original language	English
Pages (from-to)	294-311
Number of pages	18
Journal	Journal of the ACM
Volume	47
Issue number	2
DOIs	https://doi.org/10.1145/333979.333984
State	Published - 2000
Externally published	Yes

Keywords

Computational complexity
Derandomization
Short pseudorandom walks on graphs
Space bounded computations
Undirected graph connectivity

Access to Document

10.1145/333979.333984

Cite this

@article{d4677f2c40374f1abca37d091505c7df,

title = "An O(Iog(n)4/3) Space Algorithm for (s, t) Connectivity in Undirected Graphs",

abstract = "We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(Iog4/3 n) space. This improves the previous O(log3/2 n) bound of Nisan et al. [1992].",

keywords = "Computational complexity, Derandomization, Short pseudorandom walks on graphs, Space bounded computations, Undirected graph connectivity",

author = "Roy Armoni and Amnon Ta-Shma and Avi Wigderson and Shiyu Zhou",

year = "2000",

doi = "10.1145/333979.333984",

language = "אנגלית",

volume = "47",

pages = "294--311",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - An O(Iog(n)4/3) Space Algorithm for (s, t) Connectivity in Undirected Graphs

AU - Armoni, Roy

AU - Ta-Shma, Amnon

AU - Wigderson, Avi

AU - Zhou, Shiyu

PY - 2000

Y1 - 2000

N2 - We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(Iog4/3 n) space. This improves the previous O(log3/2 n) bound of Nisan et al. [1992].

AB - We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(Iog4/3 n) space. This improves the previous O(log3/2 n) bound of Nisan et al. [1992].

KW - Computational complexity

KW - Derandomization

KW - Short pseudorandom walks on graphs

KW - Space bounded computations

KW - Undirected graph connectivity

UR - http://www.scopus.com/inward/record.url?scp=0005302745&partnerID=8YFLogxK

U2 - 10.1145/333979.333984

DO - 10.1145/333979.333984

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0005302745

SN - 0004-5411

VL - 47

SP - 294

EP - 311

JO - Journal of the ACM

JF - Journal of the ACM

IS - 2

ER -

An O(Iog(n)^4/3) Space Algorithm for (s, t) Connectivity in Undirected Graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this