3 citations · 5 across the 13 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DC2021★ 1 cited
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…
cs.DC2021★ 3 cited
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…