Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Frontiers in Algorithmics

FAW 2016: Frontiers in Algorithmics pp 215–226Cite as

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9711))

Abstract

We present improvements to a branch-and-bound maximum-clique-finding algorithm MCS (WALCOM 2010, LNCS 5942, pp. 191–203) that was shown to be fast. First, we employ an efficient approximation algorithm for finding a maximum clique. Second, we make use of appropriate sorting of vertices only near the root of the search tree. Third, we employ a lightened approximate coloring mainly near the leaves of the search tree. A new algorithm obtained from MCS with the above improvements is named MCT. It is shown that MCT is much faster than MCS by extensive computational experiments. In particular, MCT is shown to be faster than MCS for gen400_p0.9_75 and gen400_p0.9_65 by over 328,000 and 77,000 times, respectively.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27, 397–416 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm

  3. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Supplement, vol. A, pp. 1–74. Kluwer Academic Publishers, Boston (1999)

    Chapter  Google Scholar 

  4. Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375–382 (1990)

    Article  MATH  Google Scholar 

  5. Fujii, T., Tomita, E.: On efficient algorithms for finding a maximum clique, Technical report of IECE, AL81-113, 25–34 (1982)

    Google Scholar 

  6. Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability. DIMACS Series in DMTCS, vol. 26. American Mathematical Society, Boston (1996)

    MATH  Google Scholar 

  7. Katayama, K., Hamamoto, A., Narihisa, H.: An effective local search for the maximum clique problem. Inf. Process. Lett. 95, 503–511 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kohata, Y., Nishijima, T., Tomita, E., Fujihashi, C., Takahashi, H.: Efficient algorithms for finding a maximum clique, Technical report of IEICE, COMP89-113, 1–8 (1990)

    Google Scholar 

  9. Konc, J., Janežič, D.: An improved branch and bound algorithm for the maximum clique problem. MATCH Commun. Math. Comput. Chem. 58, 569–590 (2007)

    MathSciNet  MATH  Google Scholar 

  10. Li, C.M., Quan, Z.: An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem. In: AAAI Conference on AI, pp. 128–133 (2010)

    Google Scholar 

  11. Li, C.M., Quan, Z.: Combining graph structure exploitation and propositional reasoning for the maximum clique problem. In: Proceedings of the IEEE ICTAI, pp. 344–351 (2010)

    Google Scholar 

  12. Maslov, E., Batsyn, M., Pardalos, P.M.: Speeding up branch and bound algorithms for solving the maximum clique problem. J. Glob. Optim. 59, 1–21 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. Segundo, P.S., Nikolaev, A., Batsyn, M.: Infra-chromatic bound for exact maximum clique search. Comput. Oper. Res. 64, 293–303 (2015)

    Article  MathSciNet  Google Scholar 

  14. Sutani, Y., Higashi, T., Tomita, E., Takahashi, S., Nakatani, H.: A faster branch-and-bound algorithm for finding a maximum clique, Technical report of IPSJ, 2006-AL-108, 79–86 (2006)

    Google Scholar 

  15. Tomita, E., Kohata, Y., Takahashi, H.: A simple algorithm for finding a maximum clique, Technical report of the Univ. of Electro-Commun., UEC-TR-C5(1) (1988)

    Google Scholar 

  16. Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 278–289. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37, 95–111 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 191–203. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  19. Tomita, E., Sutani, Y., Higashi, T., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments. IEICE Trans. Inf. Syst. E96–D, 1286–1298 (2013)

    Article  MATH  Google Scholar 

  20. Wu, Q., Hao, J.K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242, 693–709 (2015)

    Article  MathSciNet  Google Scholar 

  21. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the STOC 2006, pp. 681–690 (2006)

    Google Scholar 

Download references

Acknowledgements

We express our sincere gratitude to the referees, E. Harley, and T. Toda for their useful comments and help. This research was supported in part by MEXT&JSPS KAKENHI Grants, JST CREST grant and Kayamori Foundation grant.

Author information

Authors and Affiliations

  1. The University of Electro-Communications, Chofu, Tokyo, 182-8585, Japan

    Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito & Mitsuo Wakatsuki

  2. CREST, JST, Chiyoda, Tokyo, 102-0076, Japan

    Hiro Ito

Authors
  1. Etsuji Tomita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kohei Yoshida
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takuro Hatta
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Atsuki Nagao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hiro Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Mitsuo Wakatsuki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Etsuji Tomita .

Editor information

Editors and Affiliations

  1. Shandong University, Jinan, China

    Daming Zhu

  2. MS EC-31, University of Texas at Dallas, Richardson, Texas, USA

    Sergey Bereg

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Tomita, E., Yoshida, K., Hatta, T., Nagao, A., Ito, H., Wakatsuki, M. (2016). A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. In: Zhu, D., Bereg, S. (eds) Frontiers in Algorithmics. FAW 2016. Lecture Notes in Computer Science(), vol 9711. Springer, Cham. https://doi.org/10.1007/978-3-319-39817-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39817-4_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39816-7

  • Online ISBN: 978-3-319-39817-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation