On Approximation Algorithms for Coloring k-Colorable Graphs

On Approximation Algorithms for Coloring k-Colorable Graphs

Bibliographic Details
Main Authors: HIRATA, Tomio, ONO, Takao, XIE, Xuzhen
Language:en
Published: Institute of Electronics, Information and Communication Engineers 2003
Subjects:
maximum degree
NP-hard
approximation algorithms
graph coloring
Online Access:http://hdl.handle.net/2237/15063
http://www.ieice.org/jpn/trans_online/index.html

Internet

http://hdl.handle.net/2237/15063
http://www.ieice.org/jpn/trans_online/index.html

Similar Items