On the Improvements of Atallah’s Algorithm

摘要：

In this paper, we give a new algorithm evolving from Atallah’s algorithm proposed in 1984, and we make many improvements: First of all, combining replaced sewing in order to simplify the third step; Secondly, we delete the fourth step. And we simplify the construction of the auxiliary graph, avoiding the second time to find Euler tour and the introduction of a mass storage array. The improvements make it quicker and simpler to find the Euler tour of an Euler graph, and the improvements dont increase time and space complexity of Atallah’s algorithm.

关键词： Euler tour Euler partition spanning tree

作者: Liu Shan Cao LiJun Liu MaoHua Zhang Lingmin Liu JingHui

作者单位: Hebei Normal University of Science and Technology, Qinhuangdao 066004

会议类型: 国际会议

会议名称: 电子商务、工程及科学领域的分布计算和应用国际会议(DCABES 2010)

会议地点: 香港

会议语种:英文

页码: 654-657

在线出版日期: 2010-08-10（万方平台首次上网日期，不代表论文的发表时间）