Brief Announcement: Feasibility of Weak Gathering in Connected-over-Time Dynamic Rings

Authors

Fukuhito Ooshita, Nara Institute of Science and TechnologyFollow
Ajoy K. Datta, University of Nevada, Las VegasFollow

Document Type

Conference Proceeding

Publication Date

10-20-2018

Publication Title

International Symposium on Stabilizing, Safety, and Security of Distributed Systems

Volume

2018

First page number:

393

Last page number:

397

Abstract

The gathering problem is a fundamental problem for cooperation of mobile agents (or simply, agents).

Disciplines

Computer Sciences

Language

English

Repository Citation

Ooshita, F., Datta, A. K. (2018). Brief Announcement: Feasibility of Weak Gathering in Connected-over-Time Dynamic Rings. International Symposium on Stabilizing, Safety, and Security of Distributed Systems, 2018 393-397.
http://dx.doi.org/10.1007/978-3-030-03232-6_27