Relaxed approximate coloring in exact maximum clique search

Authors:
Pablo San Segundo;Cristobal Tapia
Affiliations:
-;-
Venue:
Computers and Operations Research
Year:
2014

Citing 5
Cited 0

Smallest-last ordering and clustering and graph coloring algorithms

Journal of the ACM (JACM)
An efficient branch-and-bound algorithm for finding a maximum clique

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver

Applied Intelligence
An exact bit-parallel algorithm for the maximum clique problem

Computers and Operations Research
A simple and faster branch-and-bound algorithm for finding a maximum clique

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents selective coloring as a new paradigm for branch-and-bound exact maximum clique search. Approximate coloring has, in recent, years been at the heart of leading solvers in the field. Selective coloring proposes to relax coloring up to a certain threshold. The result is a less informed but lighter decision heuristic. Different operators for the remaining uncolored vertices give rise to algorithmic variants integrated in a new BBMCL framework. BBMCL allows for an interesting comparison between approximate coloring and degree-based decision heuristics. The paper also reports extensive empirical tests. Selective coloring algorithms are fastest for a large subset of the graphs considered.