Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)
- Volume 18 Issue 3
- /
- Pages.35-49
- /
- 1993
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
Analysis and Classfication of Heuristic Algorithms for Node Coloring Problem
노드채색문제에 대한 기존 해법의 분석 및 분류
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.
Keywords