Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
type: Item
instance of: scholarly article
title: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
zbMATH Open document ID: 0846.68078
DOI: 10.1007/BF01955041
author: E. Balas
author: Jue Xue
published in: Algorithmica
publication date: 1996-05-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 881757
zbMATH Keywords: minimum vertex coloring problem
zbMATH Keywords: fractional coloring problem
MaRDI profile type: Publication
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: Finding a Maximum Clique in an Arbitrary Graph
cites work: New methods to color the vertices of a graph
cites work: An exact algorithm for the maximum clique problem
cites work: Q3216686
cites work: A graph coloring algorithm for large scheduling problems
cites work: An exact algorithm for the maximum stable set problem
cites work: Q5670645
cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems
cites work: Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
full work available at URL: https://doi.org/10.1007/bf01955041
OpenAlex ID: W2053867237
description: scientific article; zbMATH DE number 881757