Anonymous Meeting in Networks

@article{Dieudonn2015AnonymousMI,
  title={Anonymous Meeting in Networks},
  author={Yoann Dieudonn{\'e} and Andrzej Pelc},
  journal={Algorithmica},
  year={2015},
  volume={74},
  pages={908-946}
}
A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are anonymous (identical), execute the same deterministic algorithm and move in synchronous rounds along links of the network. An initial configuration of agents is called gatherable if there exists a deterministic algorithm (even dedicated to this particular configuration) that achieves meeting of all agents in one node… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…