A new efficient RLF-like algorithm for the vertex coloring problem

DOI10.2298/YJOR151102003AMaRDI QIDQ5279785zbMATH OpenOpenAlexFDO

Authors Mourchid Adegbindin, Alain Hertz, Martine Bellaïche

Publication date 19 July 2017

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/yjor151102003a

zbMATH Keywords

graph coloringgreedy algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the recursive largest first algorithm for graph colouring
• An incremental search heuristic for coloring vertices of a graph
• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
• Numerical experiences with graph coloring algorithms
• Euro-Par 2004 Parallel Processing

Cited in

(2)

• scientific article; zbMATH DE number 6697958 (Why is no real title available?)
• On the recursive largest first algorithm for graph colouring

This page was built for publication: A new efficient RLF-like algorithm for the vertex coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279785)