Cover Image

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

Full description

Saved in:
Bibliographic Details
Main Authors: Mustafa, Mamat, Suyudi, ., Sukono, ., Bon, A.T.
Format: Conference or Workshop Item
Language:English
Published: 2019
Subjects:
QA Mathematics
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!
id my-unisza-ir.1866
record_format eprints
spelling my-unisza-ir.18662020-11-23T08:00:07Z http://eprints.unisza.edu.my/1866/ Find the maximum clique by graph coloring using heuristic greedy Mustafa, Mamat Suyudi, . Sukono, . Bon, A.T. QA Mathematics 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 2019 Conference or Workshop Item NonPeerReviewed text en http://eprints.unisza.edu.my/1866/1/FH03-FIK-20-37015.pdf Mustafa, Mamat and Suyudi, . and Sukono, . and Bon, A.T. (2019) Find the maximum clique by graph coloring using heuristic greedy. In: 1st GCC International Conference on Industrial Engineering and Operations Management, IEOM 2019, 26-28 November 2019, Saudi Arabia.
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
spellingShingle QA Mathematics
Mustafa, Mamat
Suyudi, .
Sukono, .
Bon, A.T.
Find the maximum clique by graph coloring using heuristic greedy
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. In this paper, Graph coloring used for to find maximum clique in a graph with heuristic greedy
format Conference or Workshop Item
author Mustafa, Mamat
Suyudi, .
Sukono, .
Bon, A.T.
author_facet Mustafa, Mamat
Suyudi, .
Sukono, .
Bon, A.T.
author_sort Mustafa, Mamat
title Find the maximum clique by graph coloring using heuristic greedy
title_short 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_sort find the maximum clique by graph coloring using heuristic greedy
publishDate 2019
url http://eprints.unisza.edu.my/1866/1/FH03-FIK-20-37015.pdf
http://eprints.unisza.edu.my/1866/
_version_ 1684657764942479360
score 13.209306

Similar Items