Deterministic rendezvous in graphs

Anders Dessmark, P Fraigniaud, A Pelc

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

    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.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (Algorithms - ESA 2003)
    PublisherSpringer
    Pages184-195
    Volume2832
    ISBN (Print)978-3-540-20064-2
    DOIs
    Publication statusPublished - 2003
    Event11th Annual European Symposium - ESA - Budapest, Hungary
    Duration: 2003 Sep 162003 Sep 19

    Publication series

    Name
    Volume2832
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference11th Annual European Symposium - ESA
    Country/TerritoryHungary
    CityBudapest
    Period2003/09/162003/09/19

    Subject classification (UKÄ)

    • Computer Science

    Fingerprint

    Dive into the research topics of 'Deterministic rendezvous in graphs'. Together they form a unique fingerprint.

    Cite this