• Different speeds suffice for rendezvous of two agents on arbitrary graphs 

      Kranakis E., Krizanc D., Markou E., Pagourtzis A., Ramírez F. (2017)
      We consider the rendezvous problem for two robots on an arbitrary connected graph with n vertices and all its edges of length one. Two robots are initially located on two different vertices of the graph and can traverse ...