版权说明 操作指南
首页 > 成果 > 详情

DNA solution of a graph coloring problem

认领
导出
下载 Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Liu, YC*;Xu, J;Pan, LQ;Wang, SY
通讯作者:
Liu, YC
作者机构:
[Liu, YC] Nanhua Univ Hengyang, Dept Math & Phys Sci, Hunan 421001, Peoples R China.
Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
通讯机构:
[Liu, YC] N
Nanhua Univ Hengyang, Dept Math & Phys Sci, Hunan 421001, Peoples R China.
语种:
英文
期刊:
Journal of Chemical Information and Modeling
ISSN:
1549-9596
年:
2002
卷:
42
期:
3
页码:
524-528
机构署名:
本校为第一且通讯机构
院系归属:
数理学院
摘要:
The graph-theoretic parameter that bas 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 abili...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com