Optimization Letters

, Volume 7, Issue 3, pp 467–479

An improved bit parallel exact maximum clique algorithm

  • Pablo San Segundo
  • Fernando Matia
  • Diego Rodriguez-Losada
  • Miguel Hernando
Original Paper

DOI: 10.1007/s11590-011-0431-y

Cite this article as:
San Segundo, P., Matia, F., Rodriguez-Losada, D. et al. Optim Lett (2013) 7: 467. doi:10.1007/s11590-011-0431-y

Abstract

This paper describes new improvements for BB-MaxClique (San Segundo et al. in Comput Oper Resour 38(2):571–581, 2011), a leading maximum clique algorithm which uses bit strings to efficiently compute basic operations during search by bit masking. Improvements include a recently described recoloring strategy in Tomita et al. (Proceedings of the 4th International Workshop on Algorithms and Computation. Lecture Notes in Computer Science, vol 5942. Springer, Berlin, pp 191–203, 2010), which is now integrated in the bit string framework, as well as different optimization strategies for fast bit scanning. Reported results over DIMACS and random graphs show that the new variants improve over previous BB-MaxClique for a vast majority of cases. It is also established that recoloring is mainly useful for graphs with high densities.

Keywords

Maximum cliqueBranch and boundExact searchGraph

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  • Pablo San Segundo
    • 1
  • Fernando Matia
    • 1
  • Diego Rodriguez-Losada
    • 1
  • Miguel Hernando
    • 1
  1. 1.Center of Automatic Control and Robotics-CAR (UPM-CSIC)MadridSpain