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.
This work has been partially supported by the Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Brazil.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
V. C. BARBOSA, L. M. de A. DRUMMOND, and A. L. H. HELLMUT, From distributed algorithms to Occam programs by successive refinements, The J. of Systems and Software 26 (1994), pp. 257–272.
V. C. BARBOSA and F. M. G. FRANCA, Specification of a communication virtual processor for parallel processing systems, in Proc. of Euromicro-88 (1988), pp. 511–518.
V. C. BARBOSA and E. GAFNI, Concurrency in heavily loaded neighborhood-constrained systems, ACM Transactions on Programming Languages and Systems 11 (1989), pp. 562–584.
V. C. BARBOSA and J. L. SZWARCFITER, Generating all acyclic orientations of an undirected graph, Technical Report ES-405/96, COPPE/Federal University of Rio de Janeiro.
I. CIDON and I. S. GOPAL, Dynamic Detection of Subgraphs in Computer Networks, Algorithmica 5 (1990), pp. 277–294.
E. DAHLHAUS and M. KARPINSKI, A fast parallel algorithm for computing all maximal cliques in a graph and related problems, Proc. of the first Scandinavian Workshop on Algorithm Theory (1988), pp. 139–144.
F. M. G. FRANCA and L. FARIA, Optimal mapping of neighborhood-constrained systems, in A. Ferreira and J. Rolim eds., Lecture Notes in Computer Science 980, pp. 165–170.
E. JENNINGS and L. MOTYCKOVA, A distributed algorithm for finding all maximal cliques in a network graph, in I. Simon, ed., Lecture Notes in Computer Science 583, pp. 281–293, 1992.
D. S. JOHNSON, M. YANNAKAKIS, and C. H. PAPADIMITRIOU, On generating all maximal independent sets, Information Processing Letters 27 (1988), pp. 119–123
E. L. LAWLER, Graphical algorithms and their complexity, Mathematical Centre Tracts 81 (1976), Foundations of Computer Science II Part I, Mathematisch Centrum, Amsterdam, pp. 3–32.
M. C. PAUL and S. H. UNGER, Minimizing the number of states in incompletely specified sequential functions, IRE Trans. Electr. Computers EC-8 (1959), pp. 356–357.
E. PRISNER, Graph Dynamics, Pitman Research Notes in Mathematics Series 338 (1995), Longman.
S. TSUKIYAMA, M. IDE, H. ARUJOSHI and H. OZAKI, A new algorithm for generating all the maximal independent sets, SIAM J. Computing 6 (1977), pp. 505–517.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Protti, F., França, F.M.G., Szwarcfiter, J.L. (1997). On computing all maximal cliques distributedly. In: Bilardi, G., Ferreira, A., Lüling, R., Rolim, J. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1997. Lecture Notes in Computer Science, vol 1253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_4
Download citation
DOI: https://doi.org/10.1007/3-540-63138-0_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63138-5
Online ISBN: 978-3-540-69157-0
eBook Packages: Springer Book Archive