Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Data movement techniques for the pyramid computer
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A quadtree algorithm for template matching on a pyramid computer
Theoretical Computer Science
Parallel prefix computation on a pyramid computer
Pattern Recognition Letters
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
Algorithmic construction of Hamiltonians in pyramids
Information Processing Letters
Image Shrinking and Expanding on a Pyramid
IEEE Transactions on Parallel and Distributed Systems
The super connectivity of the pancake graphs and the super laceability of the star graphs
Theoretical Computer Science
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
The globally Bi-3*-connected property of the honeycomb rectangular torus
Information Sciences: an International Journal
Graph Theory and Interconnection Networks
Graph Theory and Interconnection Networks
| Hi-index | 0.09 |
A k-containerC(u,v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u,v) of G is a k^*-container if it contains all the vertices of G. A graph G is k^*-connected if there exists a k^*-container between any two distinct vertices in G. Let @k(G) be the connectivity of G. A graph G is superconnected if G is i^*-connected for all 1@?i@?@k(G). The pyramid network is one of the important networks applied in parallel and distributed computer systems. The connectivity of a pyramid network is three. In this paper, we prove that the pyramid network PM[n] is 3^*-connected and superconnected for n=1.