Deterministic rendezvous in graphs
(2003) 11th Annual European Symposium - ESA 2832. p.184-195- Abstract
- Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We present fast deterministic algorithms for this rendezvous problem.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/292265
- author
- Dessmark, Anders LU ; Fraigniaud, P and Pelc, A
- organization
- publishing date
- 2003
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Lecture Notes in Computer Science (Algorithms - ESA 2003)
- volume
- 2832
- pages
- 184 - 195
- publisher
- Springer
- conference name
- 11th Annual European Symposium - ESA
- conference location
- Budapest, Hungary
- conference dates
- 2003-09-16 - 2003-09-19
- external identifiers
-
- wos:000187420300019
- scopus:84958068575
- ISSN
- 1611-3349
- 0302-9743
- ISBN
- 978-3-540-20064-2
- DOI
- 10.1007/b13632
- language
- English
- LU publication?
- yes
- id
- 3d57283e-c5f6-4c85-b63e-8570aff6c67b (old id 292265)
- date added to LUP
- 2016-04-01 12:38:21
- date last changed
- 2024-01-09 03:39:56
@inproceedings{3d57283e-c5f6-4c85-b63e-8570aff6c67b,
abstract = {{Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We present fast deterministic algorithms for this rendezvous problem.}},
author = {{Dessmark, Anders and Fraigniaud, P and Pelc, A}},
booktitle = {{Lecture Notes in Computer Science (Algorithms - ESA 2003)}},
isbn = {{978-3-540-20064-2}},
issn = {{1611-3349}},
language = {{eng}},
pages = {{184--195}},
publisher = {{Springer}},
title = {{Deterministic rendezvous in graphs}},
url = {{http://dx.doi.org/10.1007/b13632}},
doi = {{10.1007/b13632}},
volume = {{2832}},
year = {{2003}},
}