Skip to main content
SpringerLink
Log in

An Exact Parallel Algorithm for the Maximum Clique Problem

  • Chapter
High Performance Algorithms and Software in Nonlinear Optimization

Part of the book series: Applied Optimization ((APOP,volume 24))

Abstract

In this paper we present a portable exact parallel algorithm for the maximum clique problem on general graphs. Computational results with random graphs and some test graphs from applications are presented. The algorithm parallelized using the Message Passing Interface (MPI) standard. The algorithm is based on the Carraghan-Pardalos exact algorithm (for unweighted graphs) and incorporates a variant of the greedy randomized adaptive search procedure (GRASP) for maximum independent set of Feo, Resende, and Smith, to obtain good starting solutions.

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

  • Alasdair, R., Bruce, A., J., and Smith, A. (1994), CHIMP/MPI user guide. Technical Report. EPCC-KTP-CHIMP-V@-USER 1.2, Edinburgh Parallel Computing Center.

    Google Scholar 

  • Ballard, D, and Brown, M. (1982). Computer Vision. Prentice-Hall, Englewood Cliffs, NJ.

    Google Scholar 

  • Berman, P. and Pelc, A. (1990). Distributed fault diagnosis for multiprocessor systems. In Proc. Of the 20th Annual Intern. Symp. on Fault-Tolerant Computing, pages. 340–346, Newcastle, UK.

    Google Scholar 

  • Berman, P. and Schnitger, G. (1989). On the complexity of approximating the independent set problem. Lecture Notes in Computer Science, 349: 256–267.

    Article  MathSciNet  Google Scholar 

  • Bonner, R. (1964). On some clustering techniques. IBM J. of Research and Development, 8: 22–32.

    Article  MATH  Google Scholar 

  • Brouwer, A.E., Shearer, J.B., Sloane, N.J.A., and smith, W.D. (1990). A new table of constant weight codes, J. IEEE. Trans. Information Theory, 36: 1334–1380.

    Article  MathSciNet  MATH  Google Scholar 

  • Burns, G., Daoud, R., and Vaigl, J. (1994). LAM: An open cluster environment for MPI. In Proceedings of Supercomputing Symposium ’94, pages 379–386. University of Toronto.

    Google Scholar 

  • Carraghan, R. and Pardalos, P. (1990). An exact algorithm for the maximum clique problem. Operations Research Letters, 9: 375–382.

    Article  MATH  Google Scholar 

  • Corradi, K. and Szabo, S. (1990). A combinatorial approach for keller’s conjecture. Periodica Mathematica Hungarica, pages 95–100.

    Google Scholar 

  • Feo, T. and Resende, M. (1995). Greedy randomized adaptive search procedures, J. of Global Optimization, 6: 109–133.

    Article  MathSciNet  MATH  Google Scholar 

  • Ferreira, A. and Pardalos, P., editors (1996). Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques, volume 1054 of Lecture notes in computer science. Springer-Verlag.

    Google Scholar 

  • Forum, M.P.I. (1994). MPI: A Message-Passing Interface standard. International J. of Supercomputer Applications and High Performance Computing, 8(3/4).

    Google Scholar 

  • Gardiner, E., Artymiuk, P., and Willet, P. (1997) Clique-detection algorithms for matching three-dimensional molecular structures. J. of Molecular Graphics and Modelling. To appear.

    Google Scholar 

  • Garey, M. and Johnson, D. (1979). Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco.

    MATH  Google Scholar 

  • Gibbons, L. (1994). Algorithms for the Maximum Clique Problem. PhD thesis, University of Florida.

    Google Scholar 

  • Gibbons, L., Hearn, D., and Pardalos, P. (1996). A continuous based heuristic for the maximum clique. In Clique, Graph Coloring, and Satisfiability: Second DIMACS Implementation Challenge, volume 26 of DIMACS Series on Discrete Mathematics and Theoretical Computers Science, Pages 103–124, American Mathematical Society.

    Google Scholar 

  • Gibbons, L., Hearn, D., Pardalos, P., and Ramana, M. (1997). A continuous characterization of the maximum clique problem. Math. Of Oper. Res., 22: 754–768.

    Article  MathSciNet  MATH  Google Scholar 

  • Gropp, W. and Lusk, E. (1994a). Installation guide to mpich, a portable implementation of MPI. Technical Report ANL-96/5. Argonne National Laboratory.

    Google Scholar 

  • Gropp W., and Lusk, E. (1994b). User’s guide for mpich, a portable implementation of the MPI. Technical Report ANL-96/6, Argonne National Laboratory.

    Google Scholar 

  • Gropp, W., and Lusk, E. (1996) A high performance, portable implementation of the mpi message passing interface standard. Technical report. Argonne National Laboratory.

    Google Scholar 

  • Gropp, W., Lusk, E., and Skjellum, A. (1994). Using MPI: Portable Parallel Programming with the Message-Passing Interface. The MIT Press.

    Google Scholar 

  • Hajós, G. (1950). Sur la factorization des abeliens. Casopis, pages 189–196.

    Google Scholar 

  • Hasselburg, J., Pardalos, P.M., and Vairaktarakis, G. (1993). Test case generators and computational results for the maximum clique problem. J. of Global Optimization, 3: 463–482.

    Article  Google Scholar 

  • Johnson, D., and Trick, M., editors (1996). Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, volume 26 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society.

    Google Scholar 

  • Lagarias, J.C., and Shor, P.W. (1992). Keller’ cube-tiling conjecture is false in high dimensions. Bulletin American Mathematical Society. 27: 279–283.

    Article  MathSciNet  MATH  Google Scholar 

  • Miller, W. (1992). Building multiple alignments form pairwise alignments. Computer Applications in the Biosciences.

    Google Scholar 

  • Pardalos, P.M., and Xue, J. (1994). The maximum clique problem. J. of Global Optimization, 4: 301–328.

    Article  MathSciNet  MATH  Google Scholar 

  • Perron, O. (1940). Ãœber lückenlose ausfullung des n-dimensionalen raumes durch kongruente würfel. Math. Z., 46: 1–26, 161–180.

    Google Scholar 

  • Robson, J. (1986). Algorithms for maximum independent sets. J. of Algorithms, 7: 425–440.

    Article  MathSciNet  MATH  Google Scholar 

  • Sloane, N.J. A. (1989). Unsolved problems in graph theory arising from the study of codes. Graph Theory Notes of New York XVIII, pages 11–20.

    Google Scholar 

  • Snir, M., Otto, S., Huss-Lederman, S., Walker, D., and Donagarra, J. (1996). MPI: The Complete Reference. The MIT Press.

    Google Scholar 

  • Stein, S.K. and Szabó, S. (1994) Algebra and Tiling, Homomorphisms in the service of geometry. American Mathematical Society.

    Google Scholar 

  • Takefuki, Y., L Chen, K.L., and Huffman, J. (1990). Parallel algorithms for finding a near-maximum independent set of a circle graph. IEEE Transactions on Neural Networks, 1(3).

    Google Scholar 

  • Vaughan, P., Skjellum, A., Reese, D., and Cheng, F. (1995). Migrating from pvm to mpi, part I: The unify system, In Fifth Symposium on the Frontiers of Massively Parallel Computation, pages 188–495, Maclean, Virginia IEEE Computer Society Technical Committee on Computer Architecture, IEEE Computer Society Press.

    Google Scholar 

  • Vingron, M. and Pevzner, P. (1991). Motif recognition and alignment for many sequences by comparison of dot matrices. J. of Molecular Biology, 218: 33–43.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Applied Optimization, University of Florida, USA

    Panos M. Pardalos

  2. Department of Optimization and Systems Theory, Royal Institute of Technology (KTH), Sweden

    Jonas Rappe

  3. Information Sciences Research, AT&T Labs Research, USA

    Mauricio G. C. Resende

Authors
  1. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jonas Rappe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Università di Camerino, Italy

    Renato De Leone

  2. Università di Napoli Federico II, Italy

    Almerico Murli  & Gerardo Toraldo  & 

  3. University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Kluwer Academic Publishers, Boston

About this chapter

Cite this chapter

Pardalos, P.M., Rappe, J., Resende, M.G.C. (1998). An Exact Parallel Algorithm for the Maximum Clique Problem. In: De Leone, R., Murli, A., Pardalos, P.M., Toraldo, G. (eds) High Performance Algorithms and Software in Nonlinear Optimization. Applied Optimization, vol 24. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3279-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3279-4_18

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3281-7

  • Online ISBN: 978-1-4613-3279-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation