Algorithmic construction of Hamiltonians in pyramids
β Scribed by H. Sarbazi-Azad; M. Ould-Khaoua; L.M. Mackenzie
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 270 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
The hierarchical nature and rich connectivity of the pyramid network have made it a desirable topology as both a hardware architecture and software structure to solve a number of important parallel applications, for example, in image processing and machine vision. Embedding of Hamiltonian path/cycle in a host network is of great importance in network graphs and has been widely studied in the past. This paper addresses the problem of embedding Hamiltonian paths/cycles in the pyramid network.
π SIMILAR VOLUMES
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 Hami
## Dedicated to ZdzisΕaw SkupieΕ on the occasion of his 70th birthday We investigate here the hamiltonicity and traceability of a class of polytopes generalizing pyramids, prisms, and polytopes with Halin 1-skeleta.
A time-periodic Hamiltonian system is considered. It is assumed that the system has an equilibrium position in whose neighbourhood the Hamiltonian is analytic. A constructive algorithm is proposed for computing the coefficients of the normal form of the Hamiltonian. The algorithm is based on a speci