PubMed · 12086509
DNA solution of a graph coloring problem.
Abstract
The graph-theoretic parameter that has probably received the most attention over the years is the chromatic number. As is well-known, the coloring problem is an NP-Complete problem. In this paper, it has been solved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactory fidelity. This work shows further evidence for the ability of DNA computing to solve NP-Complete problems.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yachun Liu, Jin Xu, Linqiang Pan, Shiying Wang. DNA solution of a graph coloring problem.. https://doi.org/10.1021/ci010016o
Cite the original work for its findings. Save a collection to share your selection of sources.