| Item type |
SIG Technical Reports(1) |
| 公開日 |
2020-08-25 |
| タイトル |
|
|
タイトル |
Uniform Bipartition in Population Protocol Model with Arbitrary Communication Graphs |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Uniform Bipartition in Population Protocol Model with Arbitrary Communication Graphs |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Nara Institute of Science and Technology |
| 著者所属 |
|
|
|
Nara Institute of Science and Technology |
| 著者所属 |
|
|
|
Nara Institute of Science and Technology |
| 著者所属 |
|
|
|
Sorbonne Université |
| 著者所属(英) |
|
|
|
en |
|
|
Nara Institute of Science and Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Nara Institute of Science and Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Nara Institute of Science and Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Sorbonne Université |
| 著者名 |
Hiroto, Yasumi
Fukuhito, Ooshita
Michiko, Inoue
Sébastien, Tixeuil
|
| 著者名(英) |
Hiroto, Yasumi
Fukuhito, Ooshita
Michiko, Inoue
Sébastien, Tixeuil
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
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 arbitrary communication graphs. As a result, we clarify the solvability of the uniform bipartition problem with arbitrary communication graphs when agents in the population have designated initial states, under various assumptions such as the existence of a base station, symmetry of the protocol, and fairness of the execution. When the problem is solvable, we present protocols for uniform bipartition. When global fairness is assumed, the space complexity of our solutions is tight. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
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 arbitrary communication graphs. As a result, we clarify the solvability of the uniform bipartition problem with arbitrary communication graphs when agents in the population have designated initial states, under various assumptions such as the existence of a base station, symmetry of the protocol, and fairness of the execution. When the problem is solvable, we present protocols for uniform bipartition. When global fairness is assumed, the space complexity of our solutions is tight. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN1009593X |
| 書誌情報 |
研究報告アルゴリズム（AL）
巻 2020-AL-179,
号 6,
p. 1-8,
発行日 2020-08-25
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8566 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-AL20179006.pdf (813.0 kB)
