Mathematical Foundations of Computer Science 2005
DOI10.1007/11549345zbMATH Open1156.68504OpenAlexW2494705596MaRDI QIDQ5492864FDOQ5492864
Authors: Andrzej Pelc, Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, D. Krizanc, Ugo Vaccaro 
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cited In (35)
- Rendezvous in planar environments with obstacles and unknown initial distance
- On deterministic rendezvous at a node of agents with arbitrary velocities
- Title not available (Why is that?)
- Fast rendezvous on a cycle by agents with different speeds
- Linear rendezvous with asymmetric clocks
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Rendezvous of distance-aware mobile agents in unknown graphs
- Random Node-Asynchronous Updates on Graphs
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Asymptotically optimal deterministic rendezvous
- How to meet in anonymous network
- Rendezvous of two robots with visible bits
- On asynchronous rendezvous in general graphs
- Self-stabilizing rendezvous of synchronous mobile agents in graphs
- Black hole search in directed graphs
- Price of asynchrony in mobile agents computing
- Different speeds suffice for rendezvous of two agents on arbitrary graphs
- Almost optimal asynchronous rendezvous in infinite multidimensional grids
- Asynchronous Deterministic Rendezvous on the Line
- Asynchronous deterministic rendezvous in graphs
- Algorithms and Computation
- Deterministic Rendezvous in Restricted Graphs
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- Deterministic rendezvous in graphs
- Uniform multi-agent deployment on a ring
- Deterministic rendezvous in graphs
- How to meet asynchronously (almost) everywhere
- How to meet asynchronously (almost) everywhere
- Rendezvous of mobile agents in directed graphs
- Synchronous rendezvous for location-aware agents
- Asynchronous rendezvous with different maps
- Deterministic rendezvous with different maps
- Limit Set Reachability in Asynchronous Graph Dynamical Systems
- Asynchronous approach in the plane: a deterministic polynomial algorithm
This page was built for publication: Mathematical Foundations of Computer Science 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492864)
