On computing all maximal cliques distributedly
International Symposium on Solving Irregularly Structured Problems in Parallel, 1997•Springer
A distributed algorithm is presented for generating all maximal cliques 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 application, a distributed algorithm for constructing …
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 application, a distributed algorithm for constructing …
Abstract
A distributed algorithm is presented for generating all maximal cliques 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 application, 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.
Springer
Showing the best result for this search. See all results