|
|
|
|
|
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe and Nicola Santoro
Consider a set of k identical asynchronous mobile agents located in an anonymous ring of n nodes. The classical Gather (or Rendezvous) problem requires all agents to meet at the same node, not a priori decided, within a finite amount of time. This proble...
ver más
|
|
|
|
|