Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
Abstract
A distributed algorithm is presented for generating all maximal cIiques in a network graph, based on the sequential version of Tsukiyama et al. [TIAS77]. The time complexity of the proposed approach is restricted to the induced neighborhood of a node, and the communication complexity is O( md) where m is the number of connections, and d is the maximum degree in the graph. Messages are O(log n ) bits long, where n is the number of nodes (processors) in the system. As an appIication, a distributed algorithm for constructing the clique graph k( G) from a given network graph G is developed within the scope of dynamic transformations of topologies
