A Novel Exact Heuristic Graph Coloring Algorithm based on Finding Independent Set | Zendy

Sukrati Agrawal | Zendy; Vishal Chhabra | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Novel Exact Heuristic Graph Coloring Algorithm based on Finding Independent Set

Author(s) -

Sukrati Agrawal,

Vishal Chhabra

Publication year - 2017

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/ijca2017916013

Subject(s) - computer science , graph coloring , heuristic , set (abstract data type) , algorithm , graph , theoretical computer science , artificial intelligence , programming language

Vertex coloring is a graph coloring technique which has a wide application area to provide solution for many real world problems. The high computational complexity of graph coloring algorithm led the development of exact heuristic algorithm which can be executed in optimal time. This paper explores some existing graph coloring algorithms to propose taxonomy of exact graph coloring algorithm which is capable to execute large graphs also. This paper presented experimental result on DIMACS graph instances.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research