摘要
无向权图G(n,m)的任始结点哈密顿回路可分成两条匹配半路径,根据给定λ值,用最小权路径延长法,对所有相关半路径进行匹配,便可完全确定从最短到λ阶短哈密顿回路的匹配法和相应的匹配算法.λ阶短哈密顿回路的匹配法可用于判别权图G(n,m)是否为哈密顿图.
In an undirectional weight graph G（n,m） , H cycle of arbitrary start node can be divided into two matched half paths. According to the given λ level and using the extension of minimal weight path,we get the match method from the shortest to λ level short H cycle and the relevant matching algorithm. This method can be used to distinguish weigh graph G（n,m） from H graph.
出处
《广西科学院学报》
2006年第1期6-10,共5页
Journal of Guangxi Academy of Sciences
关键词
哈密顿回路
匹配法
权图
Hamilton cycle, match method,weight graph
