Max- and Min-Neighborhood Monopolies
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On Majority Voting Games in Trees
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Bounds for point recolouring in geometric graphs
Computational Geometry: Theory and Applications
Probabilistic local majority voting for the agreement problem on finite graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Fault recovery in wireless networks: the geometric recolouring approach
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
| Hi-index | 0.00 |
This paper provides an overview of recent developments concerning the process of local majority voting in graphs, and its basic properties, from graph theoretic and algorithmic standpoints.