Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings

标题
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
作者
关键词
Short Path, Initial Configuration, Resolution Algorithm, Symmetric Configuration, Compute Move
出版物
DISTRIBUTED COMPUTING
Volume 30, Issue 2, Pages 75-86
出版商
Springer Nature
发表日期
2016-06-28
DOI
10.1007/s00446-016-0278-7

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now