Algorithmic construction of Hamiltonians in pyramids

H. Sarbazi-Azad, M. Ould-Khaoua*, L. M. Mackenzie

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

26 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)75-79
Number of pages5
JournalInformation Processing Letters
Volume80
Issue number2
DOIs
Publication statusPublished - Oct 31 2001

Keywords

  • Embedding
  • Hamiltonian cycle
  • Hamiltonian path
  • Interconnection networks
  • Pyramid

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Algorithmic construction of Hamiltonians in pyramids'. Together they form a unique fingerprint.

Cite this