Find the maximum clique by graph coloring using heuristic greedy
Graph coloring problem is to find the minimal number of colors to color vertex of a graph in such a way that every two vertex linked by an edge have different colors. A vertex coloring algorithm has been presented. As a result of applying vertex coloring algorithm no two vertex are to be allocated...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2019
|
| 主題: | |
| 在線閱讀: | http://eprints.unisza.edu.my/1866/1/FH03-FIK-20-37015.pdf http://eprints.unisza.edu.my/1866/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Graph coloring problem is to find the minimal number of colors to color vertex of a graph in such a way that every two
vertex linked by an edge have different colors. A vertex coloring algorithm has been presented. As a result of applying
vertex coloring algorithm no two vertex are to be allocated in same color if they are adjacent in graph. In this paper,
Graph coloring used for to find maximum clique in a graph with heuristic greedy |
|---|