Skip to main content
SpringerLink
Log in

A fast parallel algorithm for computing all maximal cliques in a graph and the related problems

Extended abstract

  • Conference paper
  • First Online:
SWAT 88 (SWAT 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 318))

Included in the following conference series:

Abstract

We design a fast parallel algorithm for determining all maximal cliques (maximal independent sets) in an arbitrary graph, working in O(log3(nM)) parallel time and O(M 6 n 2) processors on a CREWPRAM, where n is the number of vertices and M the number of maximal cliques. It entails the existence of deterministic NC-algorithms for several important graph classes with a polynomially bounded number of maximal cliques (maximal independent sets) in the number of vertices. Our result surprisingly generalizes the recent fast NC-algorithms of [NNS] and [DK 1] for computing all maximal cliques on chordal graphs to the arbitrary classes with polynomially many maximal cliques. Examples of these important classes of graphs besides chordal and strongly chordal graphs [NNS], [DK] are circle and circular graphs [Go], [GHS], K 4/e graphs, circular arc graphs, expander graphs, and edge graphs [Ga]. They arise in a number of applications [Ga], [TIAS], [MC], [GMS].

All computational solutions for the set of all maximal cliques or maximal independent sets up to now were inherently sequential and strongly restraining efficient parallelization [TIAS], [CN]. Our result implies that the problem of finding the maximum clique or the lexicographically first maximal clique is efficiently parallelizable for every class of graphs with polynomially many cliques. It stands in contrast to the status of these problems for an unbounded case (NP-completeness and P-completeness [Co]). It also provides another class of problems ([GK]) with superpolynomial (exponential) monotone lower bound complexity [AB], [Ra], and within the uniform Boolean circuits of O(log3 n) depth and polynomial size. The following general enumeration problem has also been proved to be in NC: Given an arbitrary graph G, and a natural number K in unary, determine K cliques of G or determine there are less than K cliques in G. We apply the new universal algebra method of the Galois connection for the lattice structure of bipartite complete graphs and the recent completeness results on such lattices.

Supported in part by Leibniz Center for Research in Computer Science and the DFG Grant KA 673/2-1

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., and Boppana, R.B., The Monotone Circuit Complexity of Boolean Functions, Manuscript, MIT 1986

    Google Scholar 

  2. Auguston, J.M. and Minker, J., An Analysis of Some Graph Theoretical Cluster Techniques, J. ACM 17 (1970), pp. 571–588

    Google Scholar 

  3. Birkhoff, G., Subdirect Unions in Universal Algebra, Bull. Amer. Soc. 50(1944), pp. 764–768

    Google Scholar 

  4. Birkhoff, G., Lattice Theory, 3rd ed. Amer. Soc., Providence 1967

    Google Scholar 

  5. Chiba, N., and Nishivuki, T., Arboricity and Subgraph Listing Algorithms, SIAM J. of Comput. 14(1985), pp. 210–223

    Google Scholar 

  6. Cole, R., Parallel Merge Sorting, Proc. 27th IEEE FOCS (1986), pp. 511–516

    Google Scholar 

  7. Cole, R., and Vishkin, U., Approximate and Exact Scheduling with Applications to List, Tree and Graph Problems, Proc. 27th IEEE FOCS (1986), pp. 478–491

    Google Scholar 

  8. Cook, S.A., A Taxonomy of Problems with Fast Parallel Algorithms, Information and Control 64 (1986), pp. 2–22

    Google Scholar 

  9. Dahlhaus, E., and Karpinski, M., The Matching Problem for Strongly Chordal Graphs is in NC, Research Report No. 855-CS, Department of Computer Science, University of Bonn 1986

    Google Scholar 

  10. Dahlhaus, E., and Karpinski, M., Fast Parallel Computation of Perfect and Strongly Perfect Elimination Schemes, IBM Research Report # RJ 5901 (59206), IBM Almaden Research Center, San Jose 1987; submitted for publication

    Google Scholar 

  11. Gabor, C.P., Hsu, W.L., and Supowit, K,J., Recognizing Circle Graphs in Polynomial Time, Proc. 26th IEEE FOCS (1985), pp. 106–116

    Google Scholar 

  12. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman:San Francisco 1979

    Google Scholar 

  13. Gavril, F., Algorithms for Minimum Coloring, Maximum Clique, Minimum Coloring by Cliques, and Maximum Independent Sets of a Chordal Graph, SIAM J. Comput. (1972), pp. 180–187

    Google Scholar 

  14. Goldberg, M., and Spencer, T., A New Parallel Algorithm for the Maximal Independent Set Problem, Proc. 28th IEEE FOCS (1987), pp. 161–165

    Google Scholar 

  15. Golumbic, M.C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980

    Google Scholar 

  16. Grigoriev, D.Yu., and Karpinski, M., The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents is in NC, Proc. 28th IEEE FOCS (1987), pp. 166–172

    Google Scholar 

  17. Grötschel, M., Lovász, L., and Schrijver, A., The Ellipsoid Method and its Consequences in Combinational Optimization, Combinatorica 1 (1987), pp. 169–197

    Google Scholar 

  18. Hirschberg, D., Fast Parallel Sorting Algorithms, Communications of the ACM 21(1978), No. 8, pp. 657–661

    Google Scholar 

  19. Luby, M., A Simple Parallel Algorithm for the Maximal Inpedendent Set Problem, Proc. 17th ACM STOC (1985), pp. 1–9

    Google Scholar 

  20. Mulligan, G.D., and Corneil, D.G., Corrections to Bierstone's Algorithm for Generating Cliques, JACM 19(1972), pp. 244–247

    Google Scholar 

  21. Naor, J., Naor, M., and Schäffer, A., Fast Parallel Algorithms for Chordal Graphs, Proc. 19th ACM STOC (1987), pp. 355–364

    Google Scholar 

  22. Razborov, A.A., Bound on the Monotone Network Complexity of the Logical Permanent, Matem. Zametk 37 (1985); in Russian

    Google Scholar 

  23. Tarjan, R., Decomposition by Clique Separations, Discrete Mathematics 55(1985), pp. 221–232

    Google Scholar 

  24. Tsukiyama, S., Ide, M., Ariyoshi, H. and Shirakawa, I., A New Algorithm for Generating All the Maximal Independent Sets, SIAM J. Comput 6(1977), pp. 505–517

    Google Scholar 

  25. Wille, R., Subdirect Decomposition of Concept Lattices, Algebra Universalis 17(1983), pp. 275–287

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bonn, 5300, Bonn 1

    Elias Dahlhaus & Marek Karpinski

Authors
  1. Elias Dahlhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf Karlsson Andrzej Lingas

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dahlhaus, E., Karpinski, M. (1988). A fast parallel algorithm for computing all maximal cliques in a graph and the related problems. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-19487-8_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19487-3

  • Online ISBN: 978-3-540-39288-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation