A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | KOSOWSKI, Adrian | |
| dc.date.accessioned | 2024-04-15T09:45:10Z | |
| dc.date.available | 2024-04-15T09:45:10Z | |
| dc.date.issued | 2013-01 | |
| dc.date.conference | 2013-01 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197893 | |
| dc.description.abstractEn | 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. | |
| dc.language.iso | en | |
| dc.publisher | SIAM | |
| dc.subject.en | undirected s-t connectivity | |
| dc.subject.en | time-space trade-off | |
| dc.subject.en | graph exploration | |
| dc.subject.en | Metropolis-Hastings walk | |
| dc.subject.en | parallel random walks | |
| dc.title.en | A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Algorithme et structure de données [cs.DS] | |
| dc.identifier.arxiv | 1204.1136 | |
| bordeaux.page | 1873-1883 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | SODA - 24th ACM-SIAM Symposium on Discrete Algorithms | |
| bordeaux.country | US | |
| bordeaux.conference.city | New Orleans | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00685373 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00685373v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2013-01&rft.spage=1873-1883&rft.epage=1873-1883&rft.au=KOSOWSKI,%20Adrian&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||