DC Field | Value | Language |
---|---|---|
dc.contributor.author | 최택진 | ko |
dc.contributor.author | 명영수 | ko |
dc.contributor.author | 차동완 | ko |
dc.date.accessioned | 2013-02-25T10:36:10Z | - |
dc.date.available | 2013-02-25T10:36:10Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1993-12 | - |
dc.identifier.citation | 한국경영과학회지, v.18, no.3, pp.35 - 49 | - |
dc.identifier.issn | 1225-1100 | - |
dc.identifier.uri | http://hdl.handle.net/10203/61554 | - |
dc.description.abstract | The node coloring problem is a problem to color the nodes of a graph using the minimum number of colors possible so that any two adjacent nodes are colored differently. This problem, along with the edge coloring problem, has a variety of practical applications particularly in item loading, resource allocation, exam timetabling, and channel assignment. The node coloring problem is an NP-hard problem, and thus many researchers develop a number of heuristic algorithms. In this paper, we survey and classify those heuristics with the emphasis on how an algorithm orders the nodes and colors the nodes using a determined ordering. | - |
dc.language | Korean | - |
dc.publisher | 한국경영과학회 | - |
dc.title | 노드채색 문제에 대한 기존 해법의 분석 및 분류 | - |
dc.title.alternative | Analysis and Classfication of Heuristic Algorithms for Node Coloring Problem | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 18 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 35 | - |
dc.citation.endingpage | 49 | - |
dc.citation.publicationname | 한국경영과학회지 | - |
dc.contributor.localauthor | 차동완 | - |
dc.contributor.nonIdAuthor | 최택진 | - |
dc.contributor.nonIdAuthor | 명영수 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.