Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A Novel DNA-Based Parallel Computation for Solving 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
$31 $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)
Chung-Wei Yeh ; Dept. of Manage. Inf. Syst., Kao Yuan Univ., Kaohsiung, Taiwan ; Kee-Rong Wu

This study provided molecular solutions for the graph coloring problems (GCP) by two steps: (1) translating vertices to strands and (2) generating DNA procedures. At the first step, we defined strands to present the vertices of graph; on the second step, we applied DNA parallel approach to construct algorithms. DNA computation takes use DNA molecules and biological operations to solve problems in a solution of DNA, where specific combination of DNA is interpreted as a particular result to a problem encoded by molecular. Based on the bio-operation proposed by Adleman and Amos, the proposed approach solves the 3-coloring and k-coloring problems with potential time complexity of O(nXk2), where n and k denote the number of vertices of graph G and the smallest positive number to color G, respectively.

Published in:

Software Engineering, 2009. WCSE '09. WRI World Congress on  (Volume:2 )

Date of Conference:

19-21 May 2009