Two-node-Hamiltonicity of enhanced pyramid networks

Authors:
Yi-Ching Chen;Dyi-Rong Duh
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei 10617, Taiwan, ROC;Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Nantou Hsein 54561, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2010

Citing 24
Cited 1

Data movement techniques for the pyramid computer

SIAM Journal on Computing
A note on time-bounded bottom-up pyramid cellular acceptors

Information Sciences: an International Journal
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel prefix computation on a pyramid computer

Pattern Recognition Letters
Parallel computation: models and methods

Parallel computation: models and methods
Detecting image primitives using feature pyramids

Information Sciences: an International Journal
Fault Tolerance Properties of Pyramid Networks

IEEE Transactions on Computers
A routing algorithm for the pyramid structures

Proceedings of the 2001 ACM symposium on Applied computing
Longest fault-free paths in star graphs with vertex faults

Theoretical Computer Science
Longest Fault-Free Paths in Star Graphs with Edge Faults

IEEE Transactions on Computers
Algorithmic construction of Hamiltonians in pyramids

Information Processing Letters
Diagonal and Toroidal Mesh Networks

IEEE Transactions on Computers
Image Shrinking and Expanding on a Pyramid

IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges

Parallel Computing
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges

IEEE Transactions on Computers
Proof that pyramid networks are 1-Hamiltonian-connected with high probability

Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults

Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs

Information Sciences: an International Journal
Hamiltonian connectivity of the WK-recursive network with faulty nodes

Information Sciences: an International Journal
Diameter variability of cycles and tori

Information Sciences: an International Journal
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults

Theoretical Computer Science
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model

Information Sciences: an International Journal
Constructing the nearly shortest path in crossed cubes

Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults

Information Sciences: an International Journal

ω-wide diameters of enhanced pyramid networks

Theoretical Computer Science

Quantified Score

Hi-index	0.07

Visualization

Abstract

An enhanced pyramid network is an alternate hierarchical structure for a pyramid network. This structure is created in a pyramid network by replacing each mesh with a torus at layers greater than one. This work studies the fault-tolerant Hamiltonian problem on the enhanced pyramid network and demonstrates that an enhanced pyramid network with two faulty nodes is Hamiltonian. The result is optimal, because edge connectivity and node connectivity of the enhanced pyramid network are both 4.