33 citations · 93 across the 33 of their papers we have counts for
15 papers · 1 filter
A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
In this paper, we propose a randomized -round algorithm for the maximum cardinality matching problem in the CONGEST model, where means the maximum size of a…
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse +1
We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutio…
Fast Neighborhood Rendezvous
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
In the rendezvous problem, two computing entities (called \emph{agents}) located at different vertices in a graph have to meet at the same vertex. In this paper, we consider the sy…
Fully Adaptive Self-Stabilizing Transformer for LCL Problems
Shimon Bitton, Yuval Emek, Taisuke Izumi +1
The first generic self-stabilizing transformer for local problems in a constrained bandwidth model is introduced. This transformer can be applied to a wide class of locally checkab…
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
Naoki Kitamura, Taisuke Izumi
For a graph G=(V,E), finding a set of disjoint edges that do not share any vertices is called a matching problem, and finding the maximum matching is a fundamental problem in the t…
Time-optimal Loosely-stabilizing Leader Election in Population Protocols
Yuichi Sudo, Ryota Eguchi, Taisuke Izumi +1
We consider the leader election problem in population protocol models. In pragmatic settings of population protocols, self-stabilization is a highly desired feature owing to its fa…