Title of article
A matched approximation bound for the sum of a greedy coloring
Author/Authors
Amotz Bar-Noy، نويسنده , , Magn?s M. Halld?rsson، نويسنده , , Guy Kortsarz، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1999
Pages
6
From page
135
To page
140
Keywords
Sum coloring , analysis of algorithms , Maximum independent set , graph coloring
Journal title
Information Processing Letters
Serial Year
1999
Journal title
Information Processing Letters
Record number
129119
Link To Document