Probabilistic Distributed Algorithm for Uniform Election in Triangular Grid Graphs

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.

Authors and Affiliations

El Stouti, Ismail Hind, Abdelaaziz Hibaoui

Keywords

Related Articles

Tennis Player Training Support System based on Sport Vision

Sports vision based tennis player training support system is proposed. In sports, gaze, dynamic visual acuity, eye movement and viewing place are important. In sports vision, Static eyesight, Dynamic visual acuity, Contr...

Sample K-Means Clustering Method for Determining the Stage of Breast Cancer Malignancy Based on Cancer Size on Mammogram Image Basis

Breast cancer is a disease that arises due to the growth of breast tissue cells that are not normal. The detection of breast cancer malignancy level / stage relies heavily on the results of the analysis of the doctor. To...

Arabic Studies’ Progress in Information Retrieval

The field of information retrieval has witnessed tangible progress over the past decades in response to the expanded usage of the internet and the dire need of users to search for massive amounts of digital information....

Acoustic Emotion Recognition Using Linear and Nonlinear Cepstral Coefficients

Recognizing human emotions through vocal channel has gained increased attention recently. In this paper, we study how used features, and classifiers impact recognition accuracy of emotions present in speech. Four emotion...

The Impact of Flyweight and Proxy Design Patterns on Software Efficiency: An Empirical Evaluation

In this era of technology, delivering quality software has become a crucial requirement for the developers. Quality software is able to help an organization to success and gain a competitive edge in the market. There are...

Download PDF file
  • EP ID EP146358
  • DOI 10.14569/IJACSA.2013.040636
  • Views 86
  • Downloads 0

How To Cite

El Stouti, Ismail Hind, Abdelaaziz Hibaoui (2013). Probabilistic Distributed Algorithm for Uniform Election in Triangular Grid Graphs. International Journal of Advanced Computer Science & Applications, 4(6), 273-282. https://europub.co.uk/articles/-A-146358