5 citations · 9 across the 12 of their papers we have counts for
18 papers
The Maximum Mutual Visibility Set on a Cactus Graph and the Self-stabilizing Constructions
Yonghwan Kim, Yuichi Sudo
Given a graph , let () be a set of vertices. Two vertices are \emph{mutually visible} if there exists a shortest path in between them that does not co…
Near-linear Time Dispersion of Mobile Agents
Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2
Consider that there are agents in a simple, connected, and undirected graph with nodes and edges. The goal of the dispersion problem is to move these …
A Nearly Time-Optimal Population Protocol for Self-Stabilizing Leader Election on Rings with Polylogarithmic States
Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita +1
We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the population protocol model. Given an integer satisfying , whe…
Partial gathering of mobile agents in dynamic rings
Masahiro Shibata, Yuichi Sudo, Junya Nakamura +1
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 part…
Gathering Despite Defected View
Yonghwan Kim, Masahiro Shibata, Yuichi Sudo +3
An autonomous mobile robot system consisting of many mobile computational entities (called robots) attracts much attention of researchers, and to clarify the relation between the c…
Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
R. Nakai, Y. Sudo, K. Wada
We consider a Gathering problem for n autonomous mobile robots with persistent memory called light in an asynchronous scheduler (ASYNC). It is well known that Gathering is impossib…