Title :
Add-On to the ETS Algorithm to Improve Its Efficiency in Special Cases Such as a Crown Graph
Author :
Jain, Parash ; Mathur, Srushti ; Bhatt, Preksha
Author_Institution :
Dept. of Inf. Technol., D.A.V.V., Indore, India
Abstract :
The ETS (Edge Table Scanning) algorithm for graph coloring problem colors almost any graph with minimum number of colors, but still, it has a limitation. This paper explains that limitation and also introduces an approach to resolve the limitation. We here-after call that approach as the "sequencing" algorithm.
Keywords :
graph colouring; crown graph; edge table scanning algorithm; graph coloring problem; sequencing algorithm; Algorithm design and analysis; Bipartite graph; Color; Communication systems; Complexity theory; Image color analysis; Information technology; ETS; Edge Sequencing; Edge Table; GCP; Graph;
Conference_Titel :
Computational Intelligence and Communication Networks (CICN), 2011 International Conference on
Conference_Location :
Gwalior
Print_ISBN :
978-1-4577-2033-8
DOI :
10.1109/CICN.2011.22
