| Revista: | Computación y Sistemas |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000457241 |
| ISSN: | 1405-5546 |
| Autors: | Fakhfakh, Faten1 Tounsi, Mohamed1 Mosbah, Mohamed2 |
| Institucions: | 1University of Sfax, Sfax. Túnez 2Universite de Bordeaux I, LaBRI Laboratory, Aquitaine. Francia 3Umm Al-Qura University, Mecca. Arabia Saudita |
| Any: | 2019 |
| Període: | Oct-Dic |
| Volum: | 23 |
| Número: | 4 |
| Paginació: | 1417-1427 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Aplicado, descriptivo |
| Resumen en inglés | Constructing maximal cliques is a well-known problem in the graph theory. Despite this problem has been well studied for decades, few efforts have been presented in distributed computing. The main contribution of this paper is to propose a distributed algorithm, modeled by local computations, for constructing all maximal and disjoint cliques in a static network. In order to prove the correctness of this algorithm, we use the formal Event-B method, which is based on the refinement technique. The latter consists in enriching a model in a step by step fashion. It is the foundation of the correct-by-construction approach which provides an easy way to prove algorithms |
| Disciplines | Ciencias de la computación |
| Paraules clau: | Inteligencia artificial, Procesamiento de datos, Programación, Redes, Algoritmos de distribución, Camarillas máxima, Corrección, Refinamiento, Estática |
| Keyword: | Artificial intelligence, Data processing, Programming, Networks, Distributed algorithms, Maximal cliques, Correctness, Refinement, Static |
| Text complet: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
