An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
type: Item
instance of: scholarly article
title: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
zbMATH Open document ID: 1127.90079
author: Etsuji Tomita
author: Toshikatsu Kameda
published in: Journal of Global Optimization
publication date: 2007-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5131216
zbMATH Keywords: Maximum clique
zbMATH Keywords: Algorithm
zbMATH Keywords: Branch-and-bound
zbMATH Keywords: Approximate coloring
zbMATH Keywords: Computational experiments
MaRDI profile type: Publication
full work available at URL: s10898-006-9039-7
OpenAlex ID: W2166742555
Wikidata QID: Q56210441
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Q5687247
cites work: Q3145799
cites work: Q5687249
cites work: An exact algorithm for the maximum clique problem
cites work: Q4411385
cites work: A fast algorithm for the maximum clique problem
cites work: Q5687246
cites work: Finding a Maximum Independent Set
cites work: The maximum clique problem
cites work: Algorithms for maximum independent sets
cites work: Target-oriented branch and bound method for global optimization
cites work: Q4452109
cites work: Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
cites work: An algorithm for finding a maximum clique in a graph
DOI: 10.1007/S10898-006-9039-7
Recommended article: Q4452109
Recommended article: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Recommended article: A branch and bound algorithm for the maximum clique problem
Recommended article: A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Recommended article: An improved branch and bound algorithm for the maximum clique problem
Recommended article: Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Recommended article: Q4411385
Recommended article: Speeding up branch and bound algorithms for solving the maximum clique problem
Recommended article: Q4527181
description: scientific article; zbMATH DE number 5131216