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: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/1866/1/FH03-FIK-20-37015.pdf http://eprints.unisza.edu.my/1866/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|