Skip to main content
Conference Proceedings

Brief announcement: Feasibility of weak gathering in connected-over-time dynamic rings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 11201 LNCS 393-397
DOI: 10.1007/978-3-030-03232-6_27
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Ooshita, F., & Datta, A. K. (2018). Brief announcement: Feasibility of weak gathering in connected-over-time dynamic rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11201 LNCS, pp. 393–397). Springer Verlag. https://doi.org/10.1007/978-3-030-03232-6_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free