11 citations · 12 across the 3 of their papers we have counts for
6 papers · 1 filter
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 …
Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane
Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
An autonomous mobile robot system is a distributed system consisting of mobile computational entities (called robots) that autonomously and repeatedly perform three operations: Loo…
A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations
Junya Nakamura, Yonghwan Kim, Yoshiaki Katayama +1
A distributed system consisting of a huge number of computational entities is prone to faults, because faults in a few nodes cause the entire system to fail. Consequently, fault to…
Self-Stabilizing Construction of a Minimal Weakly -Reachable Directed Acyclic Graph
Junya Nakamura, Masahiro Shibata, Yuichi Sudo +1
We propose a self-stabilizing algorithm to construct a minimal weakly -reachable directed acyclic graph (DAG), which is suited for routing messages on wireless networ…
The Power of Global Knowledge on Self-stabilizing Population Protocols
Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2
In the population protocol model, many problems cannot be solved in a self-stabilizing way. However, global knowledge, such as the number of nodes in a network, sometimes allows us…