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.
Published in: 1st GCC International Conference on Industrial Engineering and Operations Management, Riyadh, Saudi Arabia
Publisher: IEOM Society International
Date of Conference: November 26-28, 2019
ISBN: 978-1-5323-5951-4
ISSN/E-ISSN: 2169-8767
A New Formulation of Quadratic Assignment Problem (QAP)
8th North America Conference on Industrial Engineering and Operations Management
Published: 2023
Sales Maximization through Service Tier Introduction Utilizing LP Model and AHP-based After Sales Pursuit Strategy Selection
2nd African International Conference on Industrial Engineering and Operations Management
Published: 2020
Spatial-Temporal Coverage Planning for Universal Infrastructure Services
12th Annual International Conference on Industrial Engineering and Operations Management
Published: 2022