Deterministic rendezvous in graphs

DOI10.1007/B13632MaRDI QIDQ5897245zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Andrzej Pelc, Anders Dessmark

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Deterministic rendezvous in graphs
• Algorithms and Computation
• Asymptotically optimal deterministic rendezvous
• Mathematical Foundations of Computer Science 2005
• Asynchronous deterministic rendezvous in graphs

Cited in

(35)

• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Deterministic rendezvous with different maps
• Asynchronous deterministic rendezvous in graphs
• Map construction of unknown graphs by multiple agents
• Deterministic rendezvous in graphs
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
• Identification of vertices of vertex-labeled graphs
• Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
• Rendezvous problem
• Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
• Different speeds suffice for rendezvous of two agents on arbitrary graphs
• Asymptotically optimal deterministic rendezvous
• Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
• Rendezvous of mobile agents in directed graphs
• Asynchronous Deterministic Rendezvous on the Line
• scientific article; zbMATH DE number 1552336 (Why is no real title available?)
• On the probability of rendezvous in graphs
• Self-stabilizing rendezvous of synchronous mobile agents in graphs
• Beyond rings: gathering in 1-interval connected graphs
• Deterministic Rendezvous in Restricted Graphs
• Merging time of random mobile agents
• Collaboration without communication: evacuating two robots from a disk
• Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
• Deterministic symmetric rendezvous with tokens in a synchronous torus
• Mobile Agent Rendezvous in a Ring Using Faulty Tokens
• Black hole search in common interconnection networks
• Rendezvous of distance-aware mobile agents in unknown graphs
• Algorithms and Computation
• Time versus cost tradeoffs for deterministic rendezvous in networks
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• Deterministic treasure hunt and rendezvous in arbitrary connected graphs
• Asynchronous gathering of finite memory robots on a circle under limited visibility
• Rendezvous search on a star graph with examination costs
• Election and rendezvous with incomparable labels

This page was built for publication: Deterministic rendezvous in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897245)