应用科学学报 ›› 1990, Vol. 8 ›› Issue (1): 36-40.
• 论文 • 上一篇 下一篇
胡美琛
收稿日期:
修回日期:
出版日期:
发布日期:
HU MEICHKNG
Received:
Revised:
Online:
Published:
摘要: 图的平面性判定算法是相当复杂的.本文介绍哈密顿图的一个简单的判定算法,有关图的平面性判定方面的研究可见参考文献.
Abstract: Planarity testing algorithm of graphs is a quite complex process. In this paper, we give a much simpler testing algorithm of the Hamiltonian graph. For the algorithms to test graphs for planarity, refer to the references.
胡美琛. 哈密顿平面图的一个判定算法[J]. 应用科学学报, 1990, 8(1): 36-40.
HU MEICHKNG. A PLANARITY TESTING ALGORITHM OF HAMILTONIAN GRAPH[J]. Journal of Applied Sciences, 1990, 8(1): 36-40.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jas.shu.edu.cn/CN/
https://www.jas.shu.edu.cn/CN/Y1990/V8/I1/36