Publication:5705147
From MaRDI portal
zbMath1079.68076MaRDI QIDQ5705147
Publication date: 8 November 2005
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Reducing graph coloring to clique search, Coloring the nodes of a directed graph, A clique search problem and its application to machine scheduling, Numerical experiments with LP formulations of the maximum clique problem, Estimating clique size by coloring the nodes of auxiliary graphs, Coloring the edges of a directed graph, Edge coloring of graphs, uses, limitation, complexity, A review on algorithms for maximum clique problems, On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes, An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique
Uses Software