Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Parallel computation: models and methods
Parallel computation: models and methods
Cycles in the cube-connected cycles graph
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Graph Theory With Applications
Graph Theory With Applications
Hi-index | 0.00 |
As circuit speeds increase and sizes decrease, lumped sum and quasi-static methods become inaccurate and rigorous analysis via the Method of Moments is then required to achieve accurate results. Unfortunately, this requires the solution of a large, dense ...