Title :
On the Improvements of Atallah´s Algorithm
Author :
Shan, Liu ; Lijun, Cao ; MaoHua, Liu ; Lingmin, Zhang ; JingHui, Liu
Author_Institution :
Hebei Normal Univ. of Sci. & Technol., Qinhuangdao, China
Abstract :
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 don´t increase time and space complexity of Atallah´s algorithm.
Keywords :
computational complexity; graph theory; parallel algorithms; Atallah algorithm; Euler graph; Euler tour; auxiliary graph; mass storage array; space complexity; time complexity; Algorithm design and analysis; Arrays; Complexity theory; Construction industry; Corporate acquisitions; Parallel algorithms; Partitioning algorithms;
Conference_Titel :
Distributed Computing and Applications to Business Engineering and Science (DCABES), 2010 Ninth International Symposium on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-7539-1
DOI :
10.1109/DCABES.2010.165
