Find the maximum clique by graph coloring using heuristic greedy

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.

[img] Text
FH03-FIK-20-37015.pdf
Restricted to Registered users only
Download (279kB)

Abstract

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

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Clique maksimum, Graph coloring, Heuristic greedy, Vertex coloring
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Informatics & Computing
Depositing User: Muhammad Akmal Azhar
Date Deposited: 23 Nov 2020 08:00
Last Modified: 23 Nov 2020 08:00
URI: http://eprints.unisza.edu.my/id/eprint/1866

Actions (login required)

View Item View Item
Welcome to UniSZA Institutional Repository (UniSZA-IR) is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.