Return to search

On Approximation Algorithms for Coloring k-Colorable Graphs

No description available.
Identiferoai:union.ndltd.org:NAGOYA/oai:ir.nul.nagoya-u.ac.jp:2237/15063
Date01 May 2003
CreatorsHIRATA, Tomio, ONO, Takao, XIE, Xuzhen
PublisherInstitute of Electronics, Information and Communication Engineers
Source SetsNagoya University
LanguageEnglish
Detected LanguageEnglish
TypeArticle(publisher)
RightsCopyright (C) 2003 IEICE

Page generated in 0.0021 seconds