Zobrazeno 1 - 10
of 14
pro vyhledávání: '"1-interval connected rings"'
Publikováno v:
Algorithms, Vol 13, Iss 6, p 141 (2020)
The researches about a mobile entity (called agent) on dynamic networks have attracted a lot of attention in recent years. Exploration which requires an agent to visit all the nodes in the network is one of the most fundamental problems. While the ex
Externí odkaz:
https://doaj.org/article/06b6b4e9e56e40c6ba08daf046878f7f
Publikováno v:
Algorithms, Vol 13, Iss 141, p 141 (2020)
Algorithms
Volume 13
Issue 6
Algorithms
Volume 13
Issue 6
The researches about a mobile entity (called agent) on dynamic networks have attracted a lot of attention in recent years. Exploration which requires an agent to visit all the nodes in the network is one of the most fundamental problems. While the ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be471a9823affce659d8c6d04215bef0
https://www.mdpi.com/1999-4893/13/6/141
https://www.mdpi.com/1999-4893/13/6/141
Autor:
Gotoh, Tsuyoshi1 (AUTHOR) t-gotoh@ist.osaka-u.ac.jp, Sudo, Yuichi1 (AUTHOR) masuzawa@ist.osaka-u.ac.jp, Ooshita, Fukuhito2 (AUTHOR) f-oosita@is.naist.jp, Masuzawa, Toshimitsu1 (AUTHOR)
Publikováno v:
Algorithms. Jun2020, Vol. 13 Issue 6, p141-141. 1p.
In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic bidirectional ring networks. When k agents are distributed in the network, the partial gathering problem requires, for a given positive integer g (< k),
Externí odkaz:
http://arxiv.org/abs/2212.03457
Autor:
Shibata, Masahiro1 (AUTHOR) shibata@csn.kyutech.ac.jp, Sudo, Yuichi2 (AUTHOR) sudo@hosei.ac.jp, Nakamura, Junya3 (AUTHOR) junya@imc.tut.ac.jp, Kim, Yonghwan4 (AUTHOR) kim@nitech.ac.jp
Publikováno v:
Information & Computation. Nov2022:Part A, Vol. 289, pN.PAG-N.PAG. 1p.
Autor:
Shibata, Masahiro, Kitamura, Naoki, Eguchi, Ryota, Sudo, Yuichi, Nakamura, Junya, Kim, Yonghwan
In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic tori. The partial gathering problem is a generalization of the (well-investigated) total gathering problem, which requires that all k agents distributed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30b1c0b2f0c2ac3b51c62d57a2d6497d
Temporal graphs (or evolving graphs) are time-varying graphs where time is assumed to be discrete. In this paper, we consider for the first time the problem of exploring temporal graphs of arbitrary unknown topology. We study the feasibility of explo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b635c537882656fc9ae0ba9a0151d973
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030643478
SSS
SSS
In this paper, we consider the uniform deployment problem of mobile agents in synchronous dynamic bidirectional rings, which requires agents to spread uniformly in the ring. So far, uniform deployment has been considered in static graphs. In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10d46cb87ba412c34e4dea8d2f398059
https://doi.org/10.1007/978-3-030-64348-5_20
https://doi.org/10.1007/978-3-030-64348-5_20
This book constitutes the refereed proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, held virtually, in November 2021. The 16 full papers, 10 short and 14 invited papers presented
Autor:
Stéphane Devismes, Neeraj Mittal
This book constitutes the refereed proceedings of the 22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2020, held in Austin, TX, USA, in November 2020.The 16 full papers, 7 short and 2 invited papers pre