Fast Collaborative Graph Exploration
| hal.structure.identifier | Department of Algorithms and Systems Modelling [ETI GUT] [Gdansk University of Technology] | |
| dc.contributor.author | DERENIOWSKI, Dariusz | |
| hal.structure.identifier | Institut für Mathematik [Berlin] | |
| dc.contributor.author | DISSER, Yann | |
| 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 | |
| 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 | PAJAK, Dominik | |
| 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 | UZNANSKI, Przemyslaw | |
| dc.contributor.editor | Nisse | |
| dc.contributor.editor | Nicolas and Rousseau | |
| dc.contributor.editor | Franck and Busnel | |
| dc.contributor.editor | Yann | |
| dc.date.accessioned | 2024-04-15T09:43:26Z | |
| dc.date.available | 2024-04-15T09:43:26Z | |
| dc.date.issued | 2013-05-05 | |
| dc.date.conference | 2013-05-05 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197766 | |
| dc.description.abstractEn | We study the following scenario of online graph exploration. A team of $k$ agents is initially located at a distinguished vertex $r$ of an undirected graph. In each time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains a list of the identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure that every vertex has been visited by some agent. We consider two communication models: one in which all agents have global knowledge of the state of the exploration, and one in which agents may only exchange information when simultaneously located at the same vertex. As our main result, we provide the first strategy which performs exploration of a graph with $n$ vertices at a distance of at most $D$ from $r$ in time $O(D)$, using a team of agents of polynomial size $k = D n^{1+ \epsilon} < n^{2+\epsilon}$, for any $\epsilon > 0$. Our strategy works in the local communication model, without knowledge of global parameters such as $n$ or $D$. For any constant $c>1$, we show that in the global communication model, a team of $k = D n^c$ agents can always complete exploration in $D(1+ \frac{1}{c-1} +o(1))$ time steps, whereas at least $D(1+ \frac{1}{c} -o(1))$ steps are sometimes required. In the local communication model, $D(1+ \frac{2}{c-1} +o(1))$ steps always suffice to complete exploration, and at least $D(1+ \frac{2}{c} -o(1))$ steps are sometimes required. | |
| dc.language.iso | en | |
| dc.source.title | 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel) | |
| dc.title.en | Fast Collaborative Graph Exploration | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.page | 1-4 | |
| 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 | 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel) | |
| bordeaux.country | FR | |
| bordeaux.title.proceeding | 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel) | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00818451 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00818451v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=15%C3%A8mes%20Rencontres%20Francophones%20sur%20les%20Aspects%20Algorithmiques%20des%20T%C3%A9l%C3%A9communications%20(AlgoTel)&rft.date=2013-05-05&rft.spage=1-4&rft.epage=1-4&rft.au=DERENIOWSKI,%20Dariusz&DISSER,%20Yann&KOSOWSKI,%20Adrian&PAJAK,%20Dominik&UZNANSKI,%20Przemyslaw&rft.genre=unknown |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||