COSINE: A new graph coloring algorithm

DOI10.1016/0167-6377(91)90043-OzbMath0745.05051OpenAlexW2049930910MaRDI QIDQ1180823

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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Some experiments with simulated annealing for coloring graphs
• An introduction to timetabling
• A fast algorithm for coloring Meyniel graphs
• The ellipsoid method and its consequences in combinatorial optimization
• A graph coloring algorithm for large scheduling problems
• A new graph colouring algorithm
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• `` Strong NP-Completeness Results
• New methods to color the vertices of a graph
• A technique for colouring a graph applicable to large scale timetabling problems

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