Using the huge parallelism of DNA sticker models, we first decompose the vertex-coloring problems of graph into vertex-independent set problems and vertex-partition problems from the essence of problems and show DNA sticker algorithms of the two problems.
利用DNA粘贴模型的巨大并行性,从图顶点着色问题的本质出发,先把着色问题分解成顶点独立集问题和顶点划分问题并给出这两个问题的DNA粘贴算法,然后调用这两个算法解决了图顶点着色问题。
Some relations between the independence number and other parameters in K_(1,r) -free graphs;
K_(1 ,r)- free图中点独立数与其它参数之间的关系(英文)
本网站所收集内容来自网友分享仅供参考,实际请以各学校实际公布信息为主!内容侵权及错误投诉:1553292129@qq.com
CopyRight © 2020-2024 优校网[www.youxiaow.com]版权所有 All Rights Reserved. ICP备案号:浙ICP备2024058711号