[[abstract]]Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network (EPM, for short), by replacing each mesh in a pyramid network (PM, for short) with a torus. Recently, some topological properties and communication on the EPMs have been investigated or derived. Their results have revealed that an EPM is an attractive alternative to a PM. This study investigates the node-disjoint paths between any two distinct nodes and the upper bound of the omega-wide-diameter of an EPM. This result shows that the EPMs have smaller omega-wide-diameters than the PMs.[[note]]SC
Due to its simplicity, the hypercube topology is popular as interconnection network of parallel syst...
In a (d, k)-graph problem, the Petersen graph has a maximum of 10 nodes at degree 3 and diameter 2. ...
[[abstract]]Suppose G = (V, E) is a graph and D = (V, F) is a strong digraph of G. Let u and v be tw...
[[abstract]]Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid netw...
AbstractChen et al. proposed in 2004 a new hierarchy structure, called the enhanced pyramid network ...
[[abstract]]Chen et al. proposed in 2004 a new hierarchy structure, called the enhanced pyramid netw...
[[abstract]]An enhanced pyramid network is an alternate hierarchical structure for a pyramid network...
[[abstract]]An enhanced pyramid network is an alternate hierarchical structure for a pyramid network...
[[abstract]]An n-dimensional hierarchical cubic network [denoted by HCN(n)] contains 2(n) n-dimensio...
[[abstract]]Wu revealed in 2001 that pyramid networks are Hamiltonian-connected. This investigation ...
[[abstract]]Wu revealed in 2001 that pyramid networks are Hamiltonian-connected. This investigation ...
[[abstract]]Sarbazi-Azad, Ould-Khaoua, and Mackenzie proved in 2001 that there exists a Hamiltonian ...
[[abstract]]Sarbazi-Azad, Ould-Khaoua, and Mackenzie proved in 2001 that there exists a Hamiltonian ...
AbstractA k-container C(u,v) of a graph G is a set of k-disjoint paths joining u to v. A k-container...
Reducing the VLSI layout area of on-chip networks can result in lower costs and better performance. ...
Due to its simplicity, the hypercube topology is popular as interconnection network of parallel syst...
In a (d, k)-graph problem, the Petersen graph has a maximum of 10 nodes at degree 3 and diameter 2. ...
[[abstract]]Suppose G = (V, E) is a graph and D = (V, F) is a strong digraph of G. Let u and v be tw...
[[abstract]]Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid netw...
AbstractChen et al. proposed in 2004 a new hierarchy structure, called the enhanced pyramid network ...
[[abstract]]Chen et al. proposed in 2004 a new hierarchy structure, called the enhanced pyramid netw...
[[abstract]]An enhanced pyramid network is an alternate hierarchical structure for a pyramid network...
[[abstract]]An enhanced pyramid network is an alternate hierarchical structure for a pyramid network...
[[abstract]]An n-dimensional hierarchical cubic network [denoted by HCN(n)] contains 2(n) n-dimensio...
[[abstract]]Wu revealed in 2001 that pyramid networks are Hamiltonian-connected. This investigation ...
[[abstract]]Wu revealed in 2001 that pyramid networks are Hamiltonian-connected. This investigation ...
[[abstract]]Sarbazi-Azad, Ould-Khaoua, and Mackenzie proved in 2001 that there exists a Hamiltonian ...
[[abstract]]Sarbazi-Azad, Ould-Khaoua, and Mackenzie proved in 2001 that there exists a Hamiltonian ...
AbstractA k-container C(u,v) of a graph G is a set of k-disjoint paths joining u to v. A k-container...
Reducing the VLSI layout area of on-chip networks can result in lower costs and better performance. ...
Due to its simplicity, the hypercube topology is popular as interconnection network of parallel syst...
In a (d, k)-graph problem, the Petersen graph has a maximum of 10 nodes at degree 3 and diameter 2. ...
[[abstract]]Suppose G = (V, E) is a graph and D = (V, F) is a strong digraph of G. Let u and v be tw...