On computing all maximal cliques distributedly

Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T13:06:13Z No. of bitstreams: 1 01_97_000575773.pdf: 651605 bytes, checksum: 4ed82f19dbd7d975b5fb463db184d858 (MD5)Made available in DSpace on 2017-08-04T13:06:13Z (GMT). No. of bitstreams: 1 01_97_000575773.pdf: 651605 bytes, checksum: 4ed82f19dbd7d975b5fb463db184d858 (MD5) Previous issue date: 1997-12-31A 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