| _version_ |
1860800054308110336
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2020-04-15 03:52:35
|
| eventvenue |
Saudi Arabia
|
| format |
Restricted Document
|
| id |
8461
|
| institution |
UniSZA
|
| originalfilename |
1866-01-FH03-FIK-20-37015.pdf
|
| person |
Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML
like Gecko) Chrome/80.0.3987.149 Safari/537.36
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=8461
|
| spelling |
8461 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=8461 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper application/pdf 3 1.6 Adobe Acrobat Pro DC 20 Paper Capture Plug-in Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML like Gecko) Chrome/80.0.3987.149 Safari/537.36 2020-04-15 03:52:35 1866-01-FH03-FIK-20-37015.pdf UniSZA Private Access 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 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 1st GCC International Conference on Industrial Engineering and Operations Management, IEOM 2019 Saudi Arabia
|
| spellingShingle |
Find the maximum clique by graph coloring using heuristic greedy
|
| summary |
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
|
| title |
Find the maximum clique by graph coloring using heuristic greedy
|
| title_full |
Find the maximum clique by graph coloring using heuristic greedy
|
| title_fullStr |
Find the maximum clique by graph coloring using heuristic greedy
|
| title_full_unstemmed |
Find the maximum clique by graph coloring using heuristic greedy
|
| title_short |
Find the maximum clique by graph coloring using heuristic greedy
|
| title_sort |
find the maximum clique by graph coloring using heuristic greedy
|