Deterministic rendezvous in graphs
From MaRDI portal
Publication:2509029
DOI10.1007/s00453-006-0074-2zbMath1100.68077OpenAlexW1988889787MaRDI QIDQ2509029
Dariusz R. Kowalski, Andrzej Pelc, Pierre Fraigniaud, Anders Dessmark
Publication date: 16 October 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://edoc.mpg.de/314448
Related Items
Byzantine gathering in networks ⋮ Rendezvous in networks in spite of delay faults ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Gathering Anonymous, Oblivious Robots on a Grid ⋮ 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 ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ 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 ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Deterministic rendezvous in infinite trees ⋮ Uniform multi-agent deployment on a ring ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Ten Open Problems in Rendezvous Search ⋮ Unnamed Item ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ 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 ⋮ Byzantine Gathering in Networks with Authenticated Whiteboards ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ Faster Treasure Hunt and Better Strongly Universal Exploration Sequences ⋮ How to meet in anonymous network ⋮ The kissing problem: how to end a gathering when everyone kisses everyone else goodbye ⋮ 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 ⋮ Quiescence of self-stabilizing gossiping among mobile agents in graphs ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Gathering on rings under the look-compute-move model ⋮ How to meet asynchronously at polynomial cost ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences ⋮ Deterministic Rendezvous with Detection Using Beeps ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Collisionless Gathering of Robots with an Extent ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Linear rendezvous with asymmetric clocks ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ 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 ⋮ Distributed graph searching with a sense of direction ⋮ Two-agent tree evacuation ⋮ Anonymous meeting in networks
