A new DSATUR-based algorithm for exact vertex coloring

Authors:
Pablo San Segundo
Affiliations:
Centro de Automática y Robótica (CAR), José Abascal 2, 28006, Madrid, Spain
Venue:
Computers and Operations Research
Year:
2012

Citing 14
Cited 1

Using tabu search techniques for graph coloring

Computing
The priority-based coloring approach to register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
New methods to color the vertices of a graph

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding

Computers and Operations Research
A cutting plane algorithm for graph coloring

Discrete Applied Mathematics
Graph colouring approaches for a satellite range scheduling problem

Journal of Scheduling
A Metaheuristic Approach for the Vertex Coloring Problem

INFORMS Journal on Computing
A Branch-and-Cut algorithm for graph coloring

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
An exact bit-parallel algorithm for the maximum clique problem

Computers and Operations Research
Safe lower bounds for graph coloring

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
An exact approach for the Vertex Coloring Problem

Discrete Optimization
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

Discrete Optimization

How many wireless resources are needed to resolve the hidden terminal problem?

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes a new exact algorithm PASS for the vertex coloring problem based on the well known DSATUR algorithm. At each step DSATUR maximizes saturation degree to select a new candidate vertex to color, breaking ties by maximum degree w.r.t. uncolored vertices. Later Sewell introduced a new tiebreaking strategy, which evaluated available colors for each vertex explicitly. PASS differs from Sewell in that it restricts its application to a particular set of vertices. Overall performance is improved when the new strategy is applied selectively instead of at every step. The paper also reports systematic experiments over 1500 random graphs and a subset of the DIMACS color benchmark.