Worst case analysis of a graph coloring algorithm

DOI10.1016/0166-218X(85)90043-5zbMath0578.05025MaRDI QIDQ1066156

Gopalakrishnan Vijayan, Jeremy P. Spinrad

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

heuristicsanalysis of algorithmsgraph coloring problemcase behaviorworst

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

A wide-ranging computational comparison of high-performance graph colouring algorithms

Cites Work

• Improving the performance guarantee for approximate graph coloring
• New methods to color the vertices of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Worst case analysis of a graph coloring algorithm