A new \textsf{DSATUR}-based algorithm for exact vertex coloring
type: Item
instance of: scholarly article
title: A new \textsf{DSATUR}-based algorithm for exact vertex coloring
zbMATH Open document ID: 1250.05113
author: Pablo San Segundo
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6107602
zbMATH Keywords: color
zbMATH Keywords: graph
zbMATH Keywords: exact
zbMATH Keywords: DSATUR
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.cor.2011.10.008
OpenAlex ID: W1991496278
cites work: Q4198056
cites work: Graph colouring approaches for a satellite range scheduling problem
cites work: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
cites work: A graph coloring algorithm for large scheduling problems
cites work: New methods to color the vertices of a graph
cites work: Q3715148
cites work: Using tabu search techniques for graph coloring
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Q5687276
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme
cites work: A metaheuristic approach for the vertex coloring problem
cites work: A survey on vertex coloring problems
cites work: A branch-and-cut algorithm for graph coloring
cites work: A cutting plane algorithm for graph coloring
cites work: A Column Generation Approach for Graph Coloring
cites work: An exact approach for the vertex coloring problem
cites work: Exact solution of graph coloring problems via constraint programming and column generation
cites work: Safe Lower Bounds for Graph Coloring
cites work: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
cites work: Q5687263
cites work: Q5670645
cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems
cites work: Chromatic Scheduling and the Chromatic Number Problem
cites work: Q4276004
cites work: An exact bit-parallel algorithm for the maximum clique problem
DOI: 10.1016/J.COR.2011.10.008
description: scientific article; zbMATH DE number 6107602