ScholarLens Back to search
2005•International Journal of Knowledge-based and Intelligent Engineering SystemsRequires access

A hybrid parallel genetic algorithm approach for graph coloring

N. SivanandamS., SumathiS., HamsapriyaT.

Open publisher page 0 citations

Abstract

Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is...

About this research paper

What this paper is about

Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is...

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is...

Key concepts: Graph coloring, Fractional coloring, List coloring, Greedy coloring, Edge coloring, Complete coloring, Graph power, Combinatorics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A hybrid parallel genetic algorithm approach for graph coloring — Research Paper | ScholarLens