期刊文献+

对Atallah算法的一些改进

Improvements on Atallah's Algorithm
下载PDF
导出
摘要 在不增加Atallah算法的时间、空间复杂度的前提下,对Atallah算法进行了以下改进:用回路合并的思想代替原来的缝合思想,简化了算法的第三步,去掉了算法的第四步;简化了辅图的构造。从而避免了二次寻找欧拉回路;避免了大容量数组的引入。 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 increase time and space complexity of Atallah' s algorithm.
出处 《河北科技师范学院学报》 CAS 2008年第1期47-50,共4页 Journal of Hebei Normal University of Science & Technology
关键词 欧拉回路 欧拉划分 生成树 Euler tour Euler partition spanning tree
  • 相关文献

参考文献7

  • 1BUCKLEY F,LEWINTER M.图论简明教程[M].李慧霸,王凤芹,译.北京:清华大学出版社,2005.
  • 2ATALLAH M, VISHKIN U. Finding Euler Tours in Parallel[J]. J Comput and System Sci, 1984,29:330-337.
  • 3AWERBUCH B, ISRAELI A, SHILOACH Y. Finding Euler Circuits in Logorithmic Parallel Time [ C]//In Proe 6th ACM Symp. On Theory of Computing, 1984:249-257.
  • 4SHILOACH Y, VISHKIN U. An O(logn) Parallel Mgorithnl[ J]. J Mgorithms, 1982,3:57-67.
  • 5TAR JAN R E, VISHKIN U. An Efficient Parallel Biconnectivity Algorithm [ J ]. SIAM J Computing, 1985 : 14.
  • 6TANG Ceshan, LIANG Weifa. Efficient Algorithms of Interzone Graphs [ J ]. Applied Mathematics : A Journal of Chinese Universities, 1989,4 (4) :534-539.
  • 7CAPRARA A. Sorting Permutations by Reversals and Eulerian Cycle Decompositions [ J ]. SIAM J Discrete Mathematics, 1999, 12: 91-110.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部