Abstract: Probabilistic algorithms are designed to handle problems that do not admit deterministic effective solutions. In the case of the election problem, many algorithms are available and applicable under appropriate assumptions, for example: the uniform election in trees, k??trees and polyominoids. In this paper, first, we introduce a probabilistic algorithm for the uniform election in the triangular grid graphs, then, we expose the set of rules that generate the class of the triangular grid graphs. The main of this paper is devoted to the analysis of our algorithm. We show that our algorithm is totally fair in so far as it gives the same probability to any vertex of the given graph to be elected.

El Mehdi Stouti, Ismail Hind and Abdelaaziz El Hibaoui, “Probabilistic Distributed Algorithm for Uniform Election in Triangular Grid Graphs” International Journal of Advanced Computer Science and Applications(IJACSA), 4(6), 2013. http://dx.doi.org/10.14569/IJACSA.2013.040636

@article{Stouti2013,
title = {Probabilistic Distributed Algorithm for Uniform Election in Triangular Grid Graphs},
journal = {International Journal of Advanced Computer Science and Applications}
doi = {10.14569/IJACSA.2013.040636},
url = {http://dx.doi.org/10.14569/IJACSA.2013.040636},
year = {2013},
publisher = {The Science and Information Organization},
volume = {4},
number = {6},
author = {El Mehdi Stouti and Ismail Hind and Abdelaaziz El Hibaoui},
}