Skip to Main content Skip to Navigation
Conference papers

Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs

Abstract : 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 investigate 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.
Complete list of metadata

https://hal.sorbonne-universite.fr/hal-03126591
Contributor : Sébastien Tixeuil Connect in order to contact the contributor
Submitted on : Sunday, January 31, 2021 - 7:56:57 PM
Last modification on : Tuesday, January 4, 2022 - 5:51:11 AM
Long-term archiving on: : Saturday, May 1, 2021 - 6:25:41 PM

File

LIPIcs-OPODIS-2020-33.pdf
Files produced by the author(s)

Identifiers

Citation

Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil. Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. 24th International Conference on Principles of Distributed Systems (OPODIS 2020), Dec 2020, Strasbourg, France. pp.33:1--33:16, ⟨10.4230/LIPIcs.OPODIS.2020.33⟩. ⟨hal-03126591⟩

Share

Metrics

Les métriques sont temporairement indisponibles