| _version_ |
1860800047147384832
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2020-06-18 02:38:49
|
| eventvenue |
Park Hotel Congress Center PilsenPilsen; Czech Republic
|
| format |
Restricted Document
|
| id |
8433
|
| institution |
UniSZA
|
| originalfilename |
1834-01-FH03-FIK-20-38047.pdf
|
| person |
Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML
like Gecko) Chrome/81.0.4044.138 Safari/537.36
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=8433
|
| spelling |
8433 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=8433 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/81.0.4044.138 Safari/537.36 2020-06-18 02:38:49 1834-01-FH03-FIK-20-38047.pdf UniSZA Private Access Graph algorithm vertex coloring 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. Graph coloring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. 3rd Eu International Conference on Industrial Engineering and Operations Management,IEOM 2019 Park Hotel Congress Center PilsenPilsen; Czech Republic
|
| spellingShingle |
Graph algorithm vertex coloring
|
| 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. Graph coloring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems.
|
| title |
Graph algorithm vertex coloring
|
| title_full |
Graph algorithm vertex coloring
|
| title_fullStr |
Graph algorithm vertex coloring
|
| title_full_unstemmed |
Graph algorithm vertex coloring
|
| title_short |
Graph algorithm vertex coloring
|
| title_sort |
graph algorithm vertex coloring
|