| 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: |
|