Asynchronous deterministic rendezvous in graphs
From MaRDI portal
Publication:2369001
DOI10.1016/j.tcs.2005.12.016zbMath1088.68140OpenAlexW2050063944MaRDI QIDQ2369001
Andrzej Pelc, Danny Krizanc, Luisa Gargano, Ugo Vaccaro, Gianluca De Marco, Evangelos Kranakis
Publication date: 28 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.12.016
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (52)
Byzantine gathering in networks ⋮ On asynchronous rendezvous in general graphs ⋮ Rendezvous in networks in spite of delay faults ⋮ ASYMPTOTICALLY OPTIMAL DETERMINISTIC RENDEZVOUS ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ Byzantine gathering in polynomial time ⋮ Price of asynchrony in mobile agents computing ⋮ Beyond Rings: Gathering in 1-Interval Connected Graphs ⋮ A general framework for searching on a line ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Almost universal anonymous rendezvous in the plane ⋮ Fast rendezvous with advice ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Deterministic rendezvous in infinite trees ⋮ Rendezvous Problem ⋮ Ten Open Problems in Rendezvous Search ⋮ Unnamed Item ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ On deterministic rendezvous at a node of agents with arbitrary velocities ⋮ Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ Faster Treasure Hunt and Better Strongly Universal Exploration Sequences ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Gathering asynchronous oblivious mobile robots in a ring ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Time versus space trade-offs for rendezvous in trees ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Move-optimal gossiping among mobile agents ⋮ Deterministic symmetric rendezvous with tokens in a synchronous torus ⋮ How to meet asynchronously at polynomial cost ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Mobile Agent Rendezvous in a Ring Using Faulty Tokens ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Gathering in dynamic rings ⋮ Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences ⋮ Searching on a line: a complete characterization of the optimal solution ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Classifying rendezvous tasks of arbitrary dimension ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Linear rendezvous with asymmetric clocks ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks
Cites Work
- Unnamed Item
- Unnamed Item
- The theory of search games and rendezvous.
- Random walks on weighted graphs and applications to on-line algorithms
- Two Dimensional Rendezvous Search
- Finding Your Kids When They Are Lost
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search on a graph
- Rendezvous search when marks are left at the starting points
- Rendezvous search on labeled networks
- Rendezvous Search on the Line
- Minimax Rendezvous on the Line
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Algorithms and Computation
- The rendezvous problem on discrete locations
- Algorithms - ESA 2003
- LATIN 2004: Theoretical Informatics
This page was built for publication: Asynchronous deterministic rendezvous in graphs
