A sequential elimination algorithm for computing bounds on the clique number of a graph
type: Item
instance of: scholarly article
title: A sequential elimination algorithm for computing bounds on the clique number of a graph
zbMATH Open document ID: 1160.05044
author: Bernard Gendron
author: Alain Hertz
author: Patrick St-Louis
published in: Discrete Optimization
publication date: 2008-08-15T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5312365
zbMATH Keywords: maximum clique
zbMATH Keywords: clique number
zbMATH Keywords: upper bounds
zbMATH Keywords: lower bounds
zbMATH Keywords: sequential elimination algorithm
MaRDI profile type: Publication
full work available at URL: j.disopt.2008.01.001
OpenAlex ID: W2115713772
cites work: Q3145799
cites work: New methods to color the vertices of a graph
cites work: A survey of local search methods for graph coloring
cites work: Q4198056
cites work: Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set
cites work: Using tabu search techniques for graph coloring
cites work: Q5687246
cites work: The sandwich theorem
cites work: On the Shannon capacity of a graph
cites work: The maximum clique problem
cites work: An inequality for the chromatic number of a graph
DOI: 10.1016/J.DISOPT.2008.01.001
description: scientific article; zbMATH DE number 5312365