By Topic

A Q'tron Neural-Network Approach to Solve the Graph Coloring Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tai-Wen Yue ; Tatung Univ., Tatung ; Zou Zhong Lee

This paper proposes a novel methodology to solve the graph coloring problem (GCP) using the Q'tron neural- network (NN) model. The Q'tron NN for GCP will be built as a known-energy system. This can make the NN local- minima-free and perform the so-called goal-directed search. Consider k-GCP as a goal to solve a GCP using at most k different colors. By continuously refining our goal, i.e., decreasing the value k, we can then 'demand' the NN to fulfill better and better goals progressively. Experiments using DI-MACS benchmarks were done using such an approach, and comparison was made with the DSATUR algorithm. The result supports the soundness of our approach.

Published in:

19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007)  (Volume:1 )

Date of Conference:

29-31 Oct. 2007