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.
Users
Please
log in to take part in the discussion (add own reviews or comments).