On time complexity for connectivity-preserving scattering of mobile robots - Sorbonne Université
Journal Articles Theoretical Computer Science Year : 2018

On time complexity for connectivity-preserving scattering of mobile robots

Domains

Distributed, Parallel, and Cluster Computing [cs.DC]

Sébastien Tixeuil  : Connect in order to contact the contributor

https://hal.sorbonne-universite.fr/hal-02076455

Submitted on : Friday, March 22, 2019-10:25:26 AM

Last modification on : Wednesday, October 30, 2024-1:33:55 PM

Consult the full text

Dates and versions

hal-02076455 , version 1 (22-03-2019)

Identifiers

Cite

Taisuke Izumi, Daichi Kaino, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil. On time complexity for connectivity-preserving scattering of mobile robots. Theoretical Computer Science, 2018, 738, pp.42-52. ⟨10.1016/j.tcs.2018.04.047⟩. ⟨hal-02076455⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA LIP6 SORBONNE-UNIVERSITE SU-SCIENCES SPRES
89 View
0 Download

Altmetric

Share

More