Advanced

Deterministic rendezvous in graphs

Dessmark, Anders LU ; Fraigniaud, P and Pelc, A (2003) 11th Annual European Symposium - ESA In Lecture Notes in Computer Science (Algorithms - ESA 2003) 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:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Lecture Notes in Computer Science (Algorithms - ESA 2003)
volume
2832
pages
184 - 195
publisher
Springer
conference name
11th Annual European Symposium - ESA
external identifiers
  • wos:000187420300019
  • scopus:84958068575
ISSN
0302-9743
1611-3349
ISBN
978-3-540-20064-2
DOI
language
English
LU publication?
yes
id
3d57283e-c5f6-4c85-b63e-8570aff6c67b (old id 292265)
date added to LUP
2007-08-29 11:50:14
date last changed
2018-05-29 12:25:45
@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         = {0302-9743},
  language     = {eng},
  pages        = {184--195},
  publisher    = {Springer},
  title        = {Deterministic rendezvous in graphs},
  url          = {http://dx.doi.org/},
  volume       = {2832},
  year         = {2003},
}