| 环上的最大最小路划分问题 |
| |
| 引用本文： | 陈嘉明.环上的最大最小路划分问题[J].甘肃联合大学学报(自然科学版),2011,25(5):17-18. |
| |
| 作者姓名： | 陈嘉明 |
| |
| 作者单位： | 玉溪农业职业技术学院,云南玉溪,653106 |
| |
| 摘 要： | 证明了环上的两个最大最小路划分问题是属于P类的,并且给出了两个强多项式时间算法.
|
| 关 键 词： | 最大最小路划分 运行时间 强多项式时间算法 |
The max-min path partition problem on the rings |
| |
| CHEN Jia-ming.The max-min path partition problem on the rings[J].Journal of Gansu Lianhe University :Natural Sciences,2011,25(5):17-18. |
| |
| Authors: | CHEN Jia-ming |
| |
| Institution: | CHEN Jia-ming(Yuxi Agricultural Vocation-Technical College,Yuxi 653106,China) |
| |
| Abstract: | Two max-min path partition problems on the rings in P were proved.Also,two polynomial-time optimal algorithms was presented. |
| |
| Keywords: | max-min path partition running time strong polynomial-time algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
