Abstract
The review of local majorities, coalitions and monopolies in graphs was presented. An overview of developments concerning the process of local majority voting in graphs, its base properties from graph theoretic and algorithmic standpoint was also given. The results showed that the probabilities ending in the all-white state in the two models were the same.
| Original language | English |
|---|---|
| Pages (from-to) | 231-257 |
| Number of pages | 27 |
| Journal | Theoretical Computer Science |
| Volume | 282 |
| Issue number | 2 |
| DOIs | |
| State | Published - 10 Jun 2002 |
| Externally published | Yes |
Bibliographical note
Funding Information:Supported in part by grants from the Israel Science Foundation and the Israel Ministry of Science and Art.
Funding
Supported in part by grants from the Israel Science Foundation and the Israel Ministry of Science and Art.
| Funders | Funder number |
|---|---|
| Israel Ministry of Science and Art | |
| Israel Science Foundation |