Modifying and Solving the Hall-allotment Problem using Graph Coloring and Genetic Algorithm

V. Vikaashini

doi:10.15613/sijrs/2021/v8i1-2/217890

ScienceGate Book Chapters

JOURNAL ARTICLE

Modifying and Solving the Hall-allotment Problem using Graph Coloring and Genetic Algorithm

V. Vikaashini

Year: 2021 Journal: ScieXplore International Journal of Research in Science Vol: 8 (1-2)Pages: 18-18

DOI: 10.15613/sijrs/2021/v8i1-2/217890

Get Full-Text PDF Get Analytical Report

Abstract

Graph Coloring plays a major role in day to day life. Graph Coloring is applied in various fields. The intense of the work is to visualize how the Graph Coloring Problem is solved using Genetic Algorithm by reducing the chromatic number using till optimum solution is reached.

Keywords:

Graph coloring Fractional coloring Allotment Greedy coloring List coloring Edge coloring Graph Computer science Algorithm Graph power Combinatorics Mathematics Discrete mathematics Line graph Biology

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.30

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

Modifying and Solving the Hall-allotment Problem using Graph Coloring and Genetic Algorithm

Abstract

Metrics

Topics

Related Documents

Solving Graph Coloring Problem Using Genetic Algorithm

Solving Graph Coloring Problem Using Graph Adjacency Matrix Algorithm

Solving Graph Coloring Problem Using Graph Adjacency Matrix Algorithm

Solving Graph Coloring Problem by Fuzzy Clustering-Based Genetic Algorithm

Solving the graph b-coloring problem with hybrid genetic algorithm