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

Podrobná bibliografia

Vydané v:	Optimization letters Ročník 7; číslo 3; s. 467 - 479
Hlavní autori:	San Segundo, Pablo, Matia, Fernando, Rodriguez-Losada, Diego, Hernando, Miguel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer-Verlag 01.03.2013
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!