Skip to Main content Skip to Navigation
Conference papers

A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity

Adrian Kosowski 1, 2
1 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : In this paper, we make use of the Metropolis-type walks due to Nonaka et al. (2010) to provide a faster solution to the $S$-$T$-connectivity problem in undirected graphs (USTCON). As our main result, we propose a family of randomized algorithms for USTCON which achieves a time-space product of $S\cdot T = \tilde O(n^2)$ in graphs with $n$ nodes and $m$ edges (where the $\tilde O$-notation disregards poly-logarithmic terms). This improves the previously best trade-off of $\tilde O(n m)$, due to Feige (1995). Our algorithm consists in deploying several short Metropolis-type walks, starting from landmark nodes distributed using the scheme of Broder et al. (1994) on a modified input graph. In particular, we obtain an algorithm running in time $\tilde O(n+m)$ which is, in general, more space-efficient than both BFS and DFS. We close the paper by showing how to fine-tune the Metropolis-type walk so as to match the performance parameters (e.g., average hitting time) of the unbiased random walk for any graph, while preserving a worst-case bound of $\tilde O(n^2)$ on cover time.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00685373
Contributor : Adrian Kosowski <>
Submitted on : Tuesday, July 10, 2012 - 12:15:21 AM
Last modification on : Tuesday, February 9, 2021 - 3:00:04 PM
Long-term archiving on: : Thursday, October 11, 2012 - 2:55:07 AM

Files

fastrw.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00685373, version 3
  • ARXIV : 1204.1136

Collections

Citation

Adrian Kosowski. A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity. SODA - 24th ACM-SIAM Symposium on Discrete Algorithms, Jan 2013, New Orleans, United States. pp.1873-1883. ⟨hal-00685373v3⟩

Share

Metrics

Record views

579

Files downloads

269