An improved bit parallel exact maximum clique algorithm
type: Item
instance of: scholarly article
title: An improved bit parallel exact maximum clique algorithm
zbMATH Open document ID: 1268.90118
author: Pablo San Segundo
author: Fernando Matía
author: Diego Rodriguez-Losada
author: Miguel Hernando
published in: Optimization Letters
publication date: 2013-03-12T00:00:00Z
full work available at URL: http://oa.upm.es/11804/
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6143311
zbMATH Keywords: maximum clique
zbMATH Keywords: branch and bound
zbMATH Keywords: exact search
zbMATH Keywords: graph
describes a project that uses: Chaff
describes a project that uses: MaxCliqueDyn
MaRDI profile type: Publication
OpenAlex ID: W2008362324
cites work: Clique-detection models in computational biochemistry and genomics
cites work: An algorithm for finding a maximum clique in a graph
cites work: An exact algorithm for the maximum clique problem
cites work: A fast algorithm for the maximum clique problem
cites work: Q4452109
cites work: An improved branch and bound algorithm for the maximum clique problem
cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
cites work: An exact bit-parallel algorithm for the maximum clique problem
cites work: Q5687246
DOI: 10.1007/S11590-011-0431-Y
description: scientific article; zbMATH DE number 6143311