A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Spectrum of Time–Space Trade-offs for Undirecteds-tConnectivity
1997
Journal of computer and system sciences (Print)
We present a family of randomized algorithms that enjoys a wide range of time space trade-offs in deciding undirected S-T-connectivity. Our trade-offs cover the whole range between breadth first search and the random walk procedure of Aleliunas et al., and achieve a time-space product of O (mn) (where n is the number of vertices in the graph, m is the number of edges, and O notation is used in order to suppress logarithmic terms). Moreover, we obtain improved time space trade-offs of O (n 2 )
doi:10.1006/jcss.1997.1471
fatcat:uf5k7ro7rzg7lfmuz4qhhushje