COSINE: A new graph coloring algorithm

DOI10.1016/0167-6377(91)90043-OMaRDI QIDQ1180823zbMATH OpenOpenAlexFDO

Authors S. Singh

Publication date 27 June 1992

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(91)90043-o

zbMATH Keywords

heuristicsperfect graphsgraph coloring algorithmoptimal coloringstabu search techniques

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4006291
• Local optimization of colorings of graphs
• CHECKCOL: improved local search for graph coloring
• Publication:4206748
• Numerical experiences with graph coloring algorithms

Cites work

• scientific article; zbMATH DE number 4006291 (Why is no real title available?)
• scientific article; zbMATH DE number 3672307 (Why is no real title available?)
• scientific article; zbMATH DE number 3404264 (Why is no real title available?)
• scientific article; zbMATH DE number 4187836 (Why is no real title available?)
• A fast algorithm for coloring Meyniel graphs
• A graph coloring algorithm for large scheduling problems
• A new graph colouring algorithm
• A technique for colouring a graph applicable to large scale timetabling problems
• An introduction to timetabling
• New methods to color the vertices of a graph
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Some experiments with simulated annealing for coloring graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Using tabu search techniques for graph coloring
• `` Strong NP-Completeness Results

This page was built for publication: COSINE: A new graph coloring algorithm

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