Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Yasumi, Hiroto"'
In this paper, we focus on graph class identification problems in the population protocol model. A graph class identification problem aims to decide whether a given communication graph is in the desired class (e.g. whether the given communication gra
Externí odkaz:
http://arxiv.org/abs/2111.05111
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular, we consider the problem in the context of \emph{arbitrary} communicati
Externí odkaz:
http://arxiv.org/abs/2011.08366
We focus on a uniform partition problem in a population protocol model. The uniform partition problem aims to divide a population into k groups of the same size, where k is a given positive integer. In the case of k=2 (called uniform bipartition), a
Externí odkaz:
http://arxiv.org/abs/1911.04678
Publikováno v:
In Theoretical Computer Science September 2021
In this paper, we consider a uniform bipartition problem in a population protocol model. The goal of the uniform bipartition problem is to divide a population into two groups of the same size. We study the problem under various assumptions: 1) a popu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cf95f5366cc63e97ea40a0f134daf67
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.