Parallel prefix computation on a pyramid computer
Pattern Recognition Letters
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
A routing algorithm for the pyramid structures
Proceedings of the 2001 ACM symposium on Applied computing
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Image Shrinking and Expanding on a Pyramid
IEEE Transactions on Parallel and Distributed Systems
Graph Containers, Information Delay, and Network Vulnerability
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Generalized Diameters of the Mesh of Trees
Theory of Computing Systems
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Strong Rabin numbers of folded hypercubes
Theoretical Computer Science
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Weak-vertex-pancyclicity of (n, k)-star graphs
Theoretical Computer Science
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 5.23 |
Chen et al. proposed in 2004 a new hierarchy structure, called the enhanced pyramid network (EPM), by replacing each mesh in a pyramid network (PM) with a torus. Recently, some topological properties and communication on an EPM have been investigated or derived. Their measurement results indicate that an EPM is an attractive alternative to a PM. This study investigates the node-disjoint paths between any two distinct nodes and computes upper and lower bounds of @w-wide diameters of an EPM. After minimizing upper bounds and maximizing lower bounds, @w-wide diameters of an EPM can then be determined.