引用本文
  • 周炳生,周勤.λ阶短哈密顿回路的最小权法[J].广西科学院学报,2005,(2):67-70,75.    [点击复制]
  • Zhou Bingsheng,Zhou Qin.The Minimal Weight Method of the λ Level Short Hamilton Cycle[J].Journal of Guangxi Academy of Sciences,2005,(2):67-70,75.   [点击复制]
【打印本页】 【在线阅读全文】【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 349次   下载 307 本文二维码信息
码上扫一扫!
λ阶短哈密顿回路的最小权法
周炳生1, 周勤2
0
(1.南京大学信息管理系, 江苏南京 210008;2.南京金陵科技学院图书馆, 江苏南京 210008)
摘要:
提出短哈密顿回路的概念,分析由延长而形成最短哈密顿回路的特点,得出求权图G(n,m)λ阶短哈密顿回路的最小权法.该最小权法不但可精确求得最短和其它阶的短哈密顿回路,而且可用于权图G(n,m)的判别,得出求λ阶短路径的最小权法.
关键词:  权图  哈密顿  最短哈密顿回路  最小权法  最短路径
DOI:
投稿时间:2004-09-23修订日期:2005-01-04
基金项目:
The Minimal Weight Method of the λ Level Short Hamilton Cycle
Zhou Bingsheng1, Zhou Qin2
(1.Dept. of Info. Mana., Nanjing University, Nanjing, Jiangsu, 210008, China;2.Library, Jinling Institute of Technology, Nanjing, Jiangsu, 210008, China)
Abstract:
The concept of the short Hamilton cycle is introduced.The minimal weight method to solve λ level short Hamilton cycle of weight graph G(n,m) is obtained by analysis of the features of the shortest Hamilton resulted from extended.Using this method can accurately get the shortest and the other's level short Hamilton cycles.This method can be used to distinguish weight graph G(n,m) and get the minimal weight method to solve λ level short path.
Key words:  weight graph  Hamilton  shortest Hamilton cycle  minimal weight method  shortest path

用微信扫一扫

用微信扫一扫