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

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⟩
49 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More