Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Feige:1996:FRL,
author = "Uriel Feige",
title = "A fast randomized {LOGSPACE} algorithm for graph
connectivity",
journal = j-THEOR-COMP-SCI,
volume = "169",
number = "2",
pages = "147--160",
day = "05",
month = dec,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:29 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=169&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=169&issue=2&aid=2321",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4260 (Computational
geometry)",
conflocation = "Jerusalem, Israel; 11-14 July 1994",
conftitle = "21st International Colloquium on Automata, Languages,
and Programming",
corpsource = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
of Sci., Rehovot, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; computational geometry; fast
randomized LOGSPACE algorithm; graph connectivity;
graph reachability; logarithmic space; polynomial time;
random walk; randomised algorithms; randomized
algorithm; reachability algorithm; undirected graph
reachability",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "P Practical; T Theoretical or Mathematical",
}