Advertisement

Reversed Search Maximum Clique Algorithm Based on Recoloring

  • Deniss KumlanderEmail author
  • Aleksandr Porošin
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)

Abstract

This work concentrates on finding maximum clique from undirected and unweighted graphs. Maximum clique problem is one of the most known NP-complete problems, the most complex problems of NP class. A lot of other problems can be transformed into clique problem, therefore solving or at least finding a faster algorithm for finding clique will automatically help to solve lots of other tasks. The main contribution of this work is a new exact algorithm for finding maximum clique, which works faster than any currently existing algorithm on a wide variety of graphs. The main idea is to combine a number of efficient improvements from different algorithms into a new one. At first sight these improvements cannot cooperate together, but a new approach of skipping vertices from further expanding instead of pruning the whole branch allows to use all the upgrades at ones. There will be some step-by-step examples with explanations which demonstrate how to use a proposed algorithm.

Keywords

Graph theory Maximum clique 

References

  1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of Np-Completeness. Freeman, New York (2003)zbMATHGoogle Scholar
  2. Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)Google Scholar
  3. Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375–382 (1990)CrossRefGoogle Scholar
  4. Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discret. Appl. Math. 120, 197–207 (2002)MathSciNetCrossRefGoogle Scholar
  5. Kumlander, D.: Some Practical Algorithms to Solve the Maximum Clique Problem. Tallinn University of Technology, Tallinn (2005)zbMATHGoogle Scholar
  6. Clarkson, K.: A modification to the greedy algorithm for vertex cover. Inf. Process. Lett. 16(1), 23–25 (1983)MathSciNetCrossRefGoogle Scholar
  7. Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525–547 (2012)CrossRefGoogle Scholar
  8. Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, DMTCS’03. Springer-Verlag, Berlin, Heidelberg, pp. 278–289 (2003)CrossRefGoogle Scholar
  9. Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37(1), 95–111 (2007)MathSciNetCrossRefGoogle Scholar
  10. Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique. In: Proceedings of the 4th International Conference on Algorithms and Computation, WALCOM’10. Springer-Verlag, Berlin, Heidelberg, pp. 191–203 (2010)CrossRefGoogle Scholar
  11. Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS Algorithm for the Maximum Clique Problem. Springer Science+Business Media, New York (2013)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.TalTechTallinnEstonia

Personalised recommendations