An improved bit parallel exact maximum clique algorithm

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization letters Ročník 7; číslo 3; s. 467 - 479
Hlavní autoři: San Segundo, Pablo, Matia, Fernando, Rodriguez-Losada, Diego, Hernando, Miguel
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer-Verlag 01.03.2013
Témata:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Exact search
Graph
Branch and bound
Maximum clique
ISSN:1862-4472, 1862-4480
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-011-0431-y