欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对一般图设计了一种新型的点可区别边染色算法。该算法把概率思想和图染色相结合，根据点可区别边染色的约束规则确立目标函数，利用交换规则逐步寻优，当目标函数的值满足要求时染色成功。给出详细算法步骤并进行了测试和分析，实验结果表明该算法可以求出满足猜想的点可区别边色数。
英文摘要：
This paper designed a new algorithm for vertex-distinguishing edge coloring of graphs. This new algorithm had com- bined probability thought and graph coloring, established objective function according to the constraint rules of vertex-distin- guishing edge coloring, used exchange rules to optimize the results gradually, accomplished coloring when the value of objec- tive function met the requirements. The paper also described the algorithm steps in detail, tested and analyzed it. And the ex- perimental results show that the edge chromatic number that the algorithm got conforms the conjecture of vertex-distinguishing edge coloring of graphs.
同期刊论文项目
同项目期刊论文
期刊信息
位置：