H图的多项式时间判定
he Determination For H Graph In Polynomial Time
一个存在有HAMILTON图的图被称作H图，本文将给出一个 H 图的充分必要条件，并给出一个多项式时间判定算法，使得此条件是多项式时间可检验的。从而证明了H图的判定问题是多项式时间可解的。
graph is called H graph,if there is a HAMILTON circuit in it.In this paper We will give a sufficient and necessary condition for H Graph. And We will give such a polynomial time algorism that the condition is examinable in Polynomial time.Therefor the problem for judging H graph is solvable in polynomial time.
谢应泰
数学计算技术、计算机技术
H图H圈多项式时间算法-覆盖链-链
H graphH circuitPolynomial time algorism-coverchain-chain
谢应泰.H图的多项式时间判定[EB/OL].(2009-08-12)[2025-08-10].http://www.paper.edu.cn/releasepaper/content/200908-203.点此复制
评论