IEEE Intl. Parallel and Distributed Processing Symposium, IPDPS 2017


Article Details
Title: Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times
Article URLs:
Alternative Article URLs: https://link.springer.com/article/10.1007/s00446-018-0345-3
Authors: Sergio Rajsbaum
  • UNAM, Instituto de Matematicas
Armando CastaƱeda
  • UNAM, Instituto de Matematicas
David Flores-PeƱaloza
  • UNAM, Facultad de Ciencias
Manuel Alcantara
  • UNAM, Facultad de Ciencias
Sharing: Research produced no artifacts
Verification: Authors have verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/ipps/RajsbaumCFA17
Author Comments:

Discuss this paper and its artifacts below