Skip to Main Content
ASME Press Select Proceedings

International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)

Editor
V. E. Muhin
V. E. Muhin
National Technical University of Ukraine
Search for other works by this author on:
W. B. Hu
W. B. Hu
Wuhan University
Search for other works by this author on:
ISBN:
9780791859742
No. of Pages:
656
Publisher:
ASME Press
Publication date:
2011

Based on DNA algorithms, we introduce a DNA computing algorithm to solve the incidence chromatic numbers of graphs. All the operations in the algorithm are accessible with molecular biotechnology. Firstly, we gave incidence graph of a graph. It turns that the incidence chromatic number of a graph is the vertex chromatic number of it's incidence graph. Secondly, we give a DNA algorithm for the Vertex Coloring Problem, together with partial results of the experiment that implements the algorithm.

Abstract
Keyword
I. Introduction
II. Vertex Coloring and Molecular Biology
III. Molecular Solution
IV. Conclusions
Acknowledgments
References
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal