DNA Computing Technique to Solve Vertex Coloring Problem

被引:1
|
作者
Hasudungan, Rofilde [1 ]
Abu Bakar, Rohani [1 ]
机构
[1] Univ Malaysia Pahang, Fak Comp Syst & Software Engn, Gambang, Malaysia
关键词
DNA computing; Vertex Coloring Problem; Combinatorial Problem; Greedy Algorithm; DNA Encoding Schema;
D O I
10.1109/ACSAT.2013.74
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
DNA computing or well known as molecular computing is computing technique using DNA molecule to store information and using biochemistry operation as computational tool to manipulate string in DNA strand to produce the result. Lipton point out massive parallelism and storage capacity make this convenient to solve combinatorial problems. In this paper we proposed DNA based computer to solve vertex coloring problem where in this paper we proposed DNA encoding and computational procedure inspired from greedy algorithm to generate all possible solutions to coloring a graph.
引用
下载
收藏
页码:341 / 345
页数:5
相关论文
共 50 条
  • [31] Vertex Ordering Algorithms for Graph Coloring Problem
    Kaya, Kamer
    Demirel, Berker
    Topal, Baris Batuhan
    Asik, Arda
    Demir, Ibrahim Bugra
    2020 28TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2020,
  • [32] Automatically Generated Algorithms for the Vertex Coloring Problem
    Contreras Bolton, Carlos
    Gatica, Gustavo
    Parada, Victor
    PLOS ONE, 2013, 8 (03):
  • [33] Two complexity results for the vertex coloring problem
    Malyshev, D. S.
    Lobanova, O. O.
    DISCRETE APPLIED MATHEMATICS, 2017, 219 : 158 - 166
  • [34] Matheuristic Variants of DSATUR for the Vertex Coloring Problem
    Dupin, Nicolas
    METAHEURISTICS, MIC 2024, PT II, 2024, 14754 : 96 - 111
  • [35] A New Biologically DNA Computational Algorithm to Solve the k-Vertex Cover Problem
    Zhao, Kai
    Wang, Zhaocai
    Lu, Yunzhao
    Qin, Jiangfeng
    Tan, Jian
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (03) : 524 - 526
  • [36] A Molecular Computing Model for Graph Coloring Problem Using DNA Quantum Dot
    Li, Jiawei
    Song, Zhichao
    Zhang, Cheng
    Yang, Jing
    Schlaberg, H. Inaki
    Liu, Shi
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1272 - 1276
  • [37] Models and heuristic algorithms for a weighted vertex coloring problem
    Malaguti, Enrico
    Monaci, Michele
    Toth, Paolo
    JOURNAL OF HEURISTICS, 2009, 15 (05) : 503 - 526
  • [38] MAXIMIZING THE NUMBER OF UNUSED COLORS IN THE VERTEX COLORING PROBLEM
    HASSIN, R
    LAHAV, S
    INFORMATION PROCESSING LETTERS, 1994, 52 (02) : 87 - 90
  • [39] Models and heuristic algorithms for a weighted vertex coloring problem
    Enrico Malaguti
    Michele Monaci
    Paolo Toth
    Journal of Heuristics, 2009, 15 : 503 - 526
  • [40] Solving vertex coloring problem with Cellular Ant Algorithm
    Wang, Yuanzhi
    Journal of Information and Computational Science, 2013, 10 (11): : 3587 - 3594