A still better performance guarantee for approximate graph coloring

Information Processing Letters

Volumn 45, Issue 1, 1993, Pages 19-23

  Halldórsson, Magnús M ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Analysis of algorithms; approximation algorithms; graph coloring

Indexed keywords

GRAPH THEORY;

APPROXIMATION ALGORITHMS; GRAPH COLORING;

ALGORITHMS;

EID: 0027201216     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(93)90246-6     Document Type: Article

References (6)

1. A better performance guarantee for approximate graph coloring
2. Approximating maximum independent sets by excluding subgraphs
3. Lower bounds for on-line graph coloring
4. Worst case behaviour of graph coloring algorithms
5. Improving the performance guarantee for approximate graph coloring