A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations

DOI10.1007/s10878-015-9862-1zbMath1347.90083OpenAlexW2032672345MaRDI QIDQ281816

Pablo San Segundo, Larisa Komosko, Mikhail Batsyn, Panos M. Pardalos

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9862-1

zbMATH Keywords

greedy algorithmgraph colouringheuristicbitwise operationssequential colouring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• An exact approach for the vertex coloring problem
• An exact bit-parallel algorithm for the maximum clique problem
• A search space ``cartography for guiding graph coloring heuristics
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring
• Improvements to MCS algorithm for the maximum clique problem
• A branch-and-cut algorithm for graph coloring
• Clustering of microarray data via clique partitioning
• New methods to color the vertices of a graph
• Parallel and On-Line Graph Coloring
• Reducibility among Combinatorial Problems
• An upper bound for the chromatic number of a graph and its application to timetabling problems

This page was built for publication: A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations