AI Chat AI Image Generator AI Video Text to Speech

JCOL: A Java package for solving the graph coloring problem

04/24/2020

∙

by , et al.

∙

∙

The graph coloring problem aims at assigning colors to the nodes of a graph such that no two connected nodes have the same color. The graph coloring problem is NP-complete and one of the harder problems to solve. Here we present a heuristic to solve this problem using three cascaded algorithms. The graph coloring problem was one of Karp’s 21 NP-complete problems, and is also know as the problem of finding the chromatic number of a graph. Several other problems reduce to graph coloring including solving generalized Sudoku puzzles.

page 1

page 2

page 3

research

∙ 08/09/2021

Two-Class (r,k)-Coloring: Coloring with Service Guarantees

This paper introduces the Two-Class (r,k)-Coloring problem: Given a fixe...

0 Pál András Papp, et al. ∙

research

∙ 11/24/2010

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs

Graph coloring, also known as vertex coloring, considers the problem of ...

0 Hugo Hernández, et al. ∙

research

∙ 01/08/2014

Variations on Memetic Algorithms for Graph Coloring Problems

Graph vertex coloring with a given number of colors is a well-known and ...

0 Laurent Moalic, et al. ∙

research

∙ 08/15/2022

Rethinking Graph Neural Networks for the Graph Coloring Problem

Graph coloring, a classical and critical NP-hard problem, is the problem...

0 Wei Li, et al. ∙

research

∙ 02/26/2019

Learning to Find Hard Instances of Graph Problems

Finding hard instances, which need a long time to solve, of graph proble...

8 Ryoma Sato, et al. ∙

research

∙ 11/17/2021

Evolutionary Algorithm for Graph Coloring Problem

The graph coloring problem (GCP) is one of the most studied NP-HARD prob...

0 Robiul Islam, et al. ∙

research

∙ 09/05/2023

On 3-Coloring Circle Graphs

Given a graph G with a fixed vertex order ≺, one obtains a circle graph ...

0 Patricia Bachmann, et al. ∙