A minimal-state processing search algorithm for graph coloring problems

Nobuo Funabiki, Teruo Hig Ashino

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

This paper presents a heuristic graph coloring algorithm named MIPS_CLR, a Minimal-state Processing Search algorithm for the graph CoLoRing problem. Given a graph G(V, E), the goal of this NP-complete problem is to find a color assignment to every vertex in V such that any pair of adjacent vertices must not receive the same color but also the total number of colors should be minimized. The graph coloring problem has been widely studied due to its large number of practical applications in various fields. In MIPS-CLR, a construction stage first generates an initial minimal state composed of as many as colored vertices by a simple greedy algorithm, after a maximal clique of G is found by a maximum clique algorithm. Then, a refinement stage iteratively seeks a solution state while keeping minimality in terms of a cost function by a minimal-state transition method. In this method, the schemes of a best color selection, a random color selection, a color assignment shuffle, and a gradual color expansion are used together to realize the discrete descent search with hill-climbing capabilities. The performance of MIPS-CLR is evaluated through solving DIMACS benchmark graph instances, where the solution quality is generally better than existing algorithms while the computation time is comparable with the best existing one. In particular, MIPS-CLR provides new lower bound solutions for several instances. The simulation results confirm the extensive search capability of our MIPS-CLR approach for the graph coloring problem.

Original languageEnglish
Pages (from-to)1420-1430
Number of pages11
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE82-A
Issue number7
Publication statusPublished - 2000
Externally publishedYes

Fingerprint

Graph Coloring
Coloring
Search Algorithm
Color
Processing
Assignment
Maximum Clique
Maximal Clique
Hill Climbing
Shuffle
Minimality
State Transition
Graph in graph theory
Greedy Algorithm
Descent
Cost functions
Cost Function
Computational complexity
Refinement
Adjacent

Keywords

  • DIMACS
  • Graph coloring
  • Heuristic algorithm
  • MIPS_CLR
  • Simulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

A minimal-state processing search algorithm for graph coloring problems. / Funabiki, Nobuo; Ashino, Teruo Hig.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E82-A, No. 7, 2000, p. 1420-1430.

Research output: Contribution to journalArticle

@article{66a53271aa774a0c85079964fdea77ee,
title = "A minimal-state processing search algorithm for graph coloring problems",
abstract = "This paper presents a heuristic graph coloring algorithm named MIPS_CLR, a Minimal-state Processing Search algorithm for the graph CoLoRing problem. Given a graph G(V, E), the goal of this NP-complete problem is to find a color assignment to every vertex in V such that any pair of adjacent vertices must not receive the same color but also the total number of colors should be minimized. The graph coloring problem has been widely studied due to its large number of practical applications in various fields. In MIPS-CLR, a construction stage first generates an initial minimal state composed of as many as colored vertices by a simple greedy algorithm, after a maximal clique of G is found by a maximum clique algorithm. Then, a refinement stage iteratively seeks a solution state while keeping minimality in terms of a cost function by a minimal-state transition method. In this method, the schemes of a best color selection, a random color selection, a color assignment shuffle, and a gradual color expansion are used together to realize the discrete descent search with hill-climbing capabilities. The performance of MIPS-CLR is evaluated through solving DIMACS benchmark graph instances, where the solution quality is generally better than existing algorithms while the computation time is comparable with the best existing one. In particular, MIPS-CLR provides new lower bound solutions for several instances. The simulation results confirm the extensive search capability of our MIPS-CLR approach for the graph coloring problem.",
keywords = "DIMACS, Graph coloring, Heuristic algorithm, MIPS_CLR, Simulation",
author = "Nobuo Funabiki and Ashino, {Teruo Hig}",
year = "2000",
language = "English",
volume = "E82-A",
pages = "1420--1430",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - A minimal-state processing search algorithm for graph coloring problems

AU - Funabiki, Nobuo

AU - Ashino, Teruo Hig

PY - 2000

Y1 - 2000

N2 - This paper presents a heuristic graph coloring algorithm named MIPS_CLR, a Minimal-state Processing Search algorithm for the graph CoLoRing problem. Given a graph G(V, E), the goal of this NP-complete problem is to find a color assignment to every vertex in V such that any pair of adjacent vertices must not receive the same color but also the total number of colors should be minimized. The graph coloring problem has been widely studied due to its large number of practical applications in various fields. In MIPS-CLR, a construction stage first generates an initial minimal state composed of as many as colored vertices by a simple greedy algorithm, after a maximal clique of G is found by a maximum clique algorithm. Then, a refinement stage iteratively seeks a solution state while keeping minimality in terms of a cost function by a minimal-state transition method. In this method, the schemes of a best color selection, a random color selection, a color assignment shuffle, and a gradual color expansion are used together to realize the discrete descent search with hill-climbing capabilities. The performance of MIPS-CLR is evaluated through solving DIMACS benchmark graph instances, where the solution quality is generally better than existing algorithms while the computation time is comparable with the best existing one. In particular, MIPS-CLR provides new lower bound solutions for several instances. The simulation results confirm the extensive search capability of our MIPS-CLR approach for the graph coloring problem.

AB - This paper presents a heuristic graph coloring algorithm named MIPS_CLR, a Minimal-state Processing Search algorithm for the graph CoLoRing problem. Given a graph G(V, E), the goal of this NP-complete problem is to find a color assignment to every vertex in V such that any pair of adjacent vertices must not receive the same color but also the total number of colors should be minimized. The graph coloring problem has been widely studied due to its large number of practical applications in various fields. In MIPS-CLR, a construction stage first generates an initial minimal state composed of as many as colored vertices by a simple greedy algorithm, after a maximal clique of G is found by a maximum clique algorithm. Then, a refinement stage iteratively seeks a solution state while keeping minimality in terms of a cost function by a minimal-state transition method. In this method, the schemes of a best color selection, a random color selection, a color assignment shuffle, and a gradual color expansion are used together to realize the discrete descent search with hill-climbing capabilities. The performance of MIPS-CLR is evaluated through solving DIMACS benchmark graph instances, where the solution quality is generally better than existing algorithms while the computation time is comparable with the best existing one. In particular, MIPS-CLR provides new lower bound solutions for several instances. The simulation results confirm the extensive search capability of our MIPS-CLR approach for the graph coloring problem.

KW - DIMACS

KW - Graph coloring

KW - Heuristic algorithm

KW - MIPS_CLR

KW - Simulation

UR - http://www.scopus.com/inward/record.url?scp=0034225034&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034225034&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034225034

VL - E82-A

SP - 1420

EP - 1430

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 7

ER -