Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Suyudi, M., Sukono, ., Mustafa, Mamat, Bon, A.T.
Format: Conference or Workshop Item
Language:English
Published: 2019
Subjects:
QA Mathematics
TA Engineering (General). Civil engineering (General)
Online Access:http://eprints.unisza.edu.my/1834/1/FH03-FIK-20-38047.pdf
http://eprints.unisza.edu.my/1834/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-unisza-ir.1834
record_format eprints
spelling my-unisza-ir.18342020-11-23T06:13:22Z http://eprints.unisza.edu.my/1834/ Graph algorithm vertex coloring Suyudi, M. Sukono, . Mustafa, Mamat Bon, A.T. QA Mathematics TA Engineering (General). Civil engineering (General) 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. 2019 Conference or Workshop Item NonPeerReviewed text en http://eprints.unisza.edu.my/1834/1/FH03-FIK-20-38047.pdf Suyudi, M. and Sukono, . and Mustafa, Mamat and Bon, A.T. (2019) Graph algorithm vertex coloring. In: 3rd Eu International Conference on Industrial Engineering and Operations Management,IEOM 2019, 23-26 July 2019, Park Hotel Congress Center PilsenPilsen; Czech Republic.
institution Universiti Sultan Zainal Abidin
building UNISZA Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Sultan Zainal Abidin
content_source UNISZA Institutional Repository
url_provider https://eprints.unisza.edu.my/
language English
topic QA Mathematics
TA Engineering (General). Civil engineering (General)
spellingShingle QA Mathematics
TA Engineering (General). Civil engineering (General)
Suyudi, M.
Sukono, .
Mustafa, Mamat
Bon, A.T.
Graph algorithm vertex coloring
description 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.
format Conference or Workshop Item
author Suyudi, M.
Sukono, .
Mustafa, Mamat
Bon, A.T.
author_facet Suyudi, M.
Sukono, .
Mustafa, Mamat
Bon, A.T.
author_sort Suyudi, M.
title Graph algorithm vertex coloring
title_short Graph algorithm vertex coloring
title_full Graph algorithm vertex coloring
title_fullStr Graph algorithm vertex coloring
title_full_unstemmed Graph algorithm vertex coloring
title_sort graph algorithm vertex coloring
publishDate 2019
url http://eprints.unisza.edu.my/1834/1/FH03-FIK-20-38047.pdf
http://eprints.unisza.edu.my/1834/
_version_ 1684657760138952704
score 13.159267

Similar Items