| 对Atallah算法的一些改进 |
| |
| 引用本文： | 刘茂华,张灵敏,阎忠文.对Atallah算法的一些改进[J].河北科技师范学院学报,2008,22(1):47-50. |
| |
| 作者姓名： | 刘茂华 张灵敏 阎忠文 |
| |
| 作者单位： | 1. 河北科技师范学院,计算机系
2. 数理系,河北,秦皇岛,066004 |
| |
| 摘 要： | 在不增加Atallall算法的时间、空间复杂度的前提下，对Atallah算法进行了以下改进：用回路合并的思想代替原来的缝合思想，简化了算法的第三步，去掉了算法的第四步；简化了辅图的构造。从而避免了二次寻找欧拉回路；避免了大容量数组的引入。
|
| 关 键 词： | 欧拉回路 欧拉划分 生成树 |
| 文章编号： | 1672-7983(2008)01-0047-04 |
| 修稿时间： | 2007年7月6日 |
Improvements on Atallah's Algorithm |
| |
| LIU Mao-hua,ZHANG Ling-min,YAN Zhong-wen.Improvements on Atallah's Algorithm[J].Journal of Hebei Normal University of Science & Technology,2008,22(1):47-50. |
| |
| Authors: | LIU Mao-hua ZHANG Ling-min YAN Zhong-wen |
| |
| Institution: | LIU Mao-hua1,ZHANG Ling-min2,YAN Zhong-wen1(1 Dept of Computer,2 Dept of Math , Phy,HNUST,Qinhuangdao Hebei,066004,China) |
| |
| Abstract: | This paper gives a new algorithm from Atallah's algorithm proposed in 1984.The authors of this paper made many improvements.First of all,combining replaced sewing.This simplified the third step.Secondly,the fourth step was deleted.This simplified the construction of the auxiliary graph,and avoided finding Euler tour for the second time.This also avoided the introduction of a mass storage array.These improvements made it quicker and simpler to find the Euler tour of an Euler graph,and the improvements didn't... |
| |
| Keywords: | Euler tour Euler partition spanning tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
