Algorithmic construction of Hamiltonians in pyramids

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

Research output: Contribution to journalArticle

25 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

Fingerprint

Hamiltonians
Pyramid
Hamiltonian path
Computer vision
Image processing
Topology
Hardware
Cycle
Machine Vision
Hardware Architecture
Parallel Applications
Image Processing
Connectivity
Software
Graph in graph theory

Keywords

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

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Algorithmic construction of Hamiltonians in pyramids. / Sarbazi-Azad, H.; Ould-Khaoua, M.; Mackenzie, L. M.

In: Information Processing Letters, Vol. 80, No. 2, 31.10.2001, p. 75-79.

Research output: Contribution to journalArticle

Sarbazi-Azad, H. ; Ould-Khaoua, M. ; Mackenzie, L. M. / Algorithmic construction of Hamiltonians in pyramids. In: Information Processing Letters. 2001 ; Vol. 80, No. 2. pp. 75-79.
@article{213d2385b0b144e190e2f4e7996894c8,
title = "Algorithmic construction of Hamiltonians in pyramids",
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.",
keywords = "Embedding, Hamiltonian cycle, Hamiltonian path, Interconnection networks, Pyramid",
author = "H. Sarbazi-Azad and M. Ould-Khaoua and Mackenzie, {L. M.}",
year = "2001",
month = "10",
day = "31",
doi = "10.1016/S0020-0190(01)00149-1",
language = "English",
volume = "80",
pages = "75--79",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Algorithmic construction of Hamiltonians in pyramids

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 2001/10/31

Y1 - 2001/10/31

N2 - 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.

AB - 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.

KW - Embedding

KW - Hamiltonian cycle

KW - Hamiltonian path

KW - Interconnection networks

KW - Pyramid

UR - http://www.scopus.com/inward/record.url?scp=0035980573&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035980573&partnerID=8YFLogxK

U2 - 10.1016/S0020-0190(01)00149-1

DO - 10.1016/S0020-0190(01)00149-1

M3 - Article

VL - 80

SP - 75

EP - 79

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 2

ER -