A Wide Classification of Graph Vertex Coloring
Journal: International Journal of Science and Research (IJSR) (Vol.11, No. 3)Publication Date: 2022-03-05
Authors : Dr A. Sri Krishna Chaitanya; Dr P. Srilakshmi;
Page : 939-941
Keywords : Coloring; Graphs; complete heuristic; recombination; configuration;
- Efficacy of Using Footwork Drills on Footwork Improvement among Badminton Players-Quasi Experimental Study
- THE EFFECT OF BALL BADMINTON GAME ON THE RALLYING ABILITY OF THE BADMINTON PLAYERS AT INTER COLLEGE LEVEL
- A COMPARATIVE STUDY OF SOME VARIABLES OF THE RESPIRATORY SYSTEM DUE TO POWER SYSTEMS OF BADMINTON PLAYERS
- Efficacy of Sodium Bicarbonate in Early Management and Reduce Vaginal Yeast Infection among Women in Jordan: A Quasi-Experimental Study
- A Quasi Experimental Study to Evaluate the Efficacy of Problem Based Learning (PBL) Method on the Knowledge and Critical Thinking of Nursing Students about Normal Labour, in Selected Institution of Uttrakhand
Abstract
Graph vertex coloring is one of the most studied NP-hard combinatorial optimization problems. Given the hardness of the problem, various heuristic algorithms have been proposed for practical graph coloring, based on local search, population-based approaches and hybrid methods. The research in graph coloring heuristics is very active and improved results have been obtained recently, notably for coloring large and very large graphs. This chapter surveys and analyzes graph coloring heuristics with a focus on the most recent advances.
Other Latest Articles
- Generalized Smart Agriculture System with the Prediction of Crop Yield Per Year
- Perception Regarding Caesarean Section Delivery among Postnatal Mothers in a Tertiary Level Hospital, Kathmandu, Nepal
- Development of Introducer Sheath Assembly for Heart Valve Insertion
- Adaptive Behavior of Bajo Tribe Communities in Indonesia
- Dental Practice during COVID-19 Pandemic - A Narrative Review
Last modified: 2022-05-14 21:02:36