An efficient algorithm for constructing Hamiltonian paths in meshes

Shao Dong Chen, Hong Shen, Rodney Topor

研究成果: Article同行評審

43 引文 斯高帕斯(Scopus)

摘要

This paper presents an efficient linear-time sequential algorithm for constructing Hamiltonian paths between two given vertices in meshes with horizontal size m and vertical size n. The algorithm first partitions the given mesh into a number of submeshes in constant steps, and then constructs a Hamiltonian cycle or path in each submesh and combines them together to become a complete Hamiltonian path in mn steps. Our algorithm has improved the previous algorithm by reducing the number of partition steps from O(m + n) to only a constant. Moreover, we show that our algorithm can be optimally parallelized to obtain a constant-time parallel algorithm on the weakest parallel machine without need of inter-processor communication, while this cannot be achieved for the previous algorithm.

原文English
頁(從 - 到)1293-1305
頁數13
期刊Parallel Computing
28
發行號9
DOIs
出版狀態Published - 9月 2002
對外發佈

指紋

深入研究「An efficient algorithm for constructing Hamiltonian paths in meshes」主題。共同形成了獨特的指紋。

引用此