An algorithm for finding a maximum clique in a graph
type: Item
instance of: scholarly article
title: An algorithm for finding a maximum clique in a graph
zbMATH Open document ID: 0908.90264
DOI: 10.1016/S0167-6377(97)00054-0
author: David R. Wood
published in: Operations Research Letters
publication date: 1998-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1207139
zbMATH Keywords: graph algorithm
zbMATH Keywords: maximum clique problem
zbMATH Keywords: branch-and-bound algorithm
zbMATH Keywords: vertex coloring
zbMATH Keywords: fractional coloring
describes a project that uses: GAP
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
cites work: Q4230322
cites work: Finding maximum cliques in arbitrary and in special graphs
cites work: A branch and bound algorithm for the maximum clique problem
cites work: A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Q3035310
cites work: New methods to color the vertices of a graph
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: An exact algorithm for the maximum clique problem
cites work: Q4198056
cites work: Q3216686
cites work: The maximum clique problem
cites work: Finding a Maximum Independent Set
full work available at URL: s0167-6377(97)00054-0
OpenAlex ID: W2002747011
description: scientific article; zbMATH DE number 1207139