Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
Purchase Benefits
What is included with this book?
Ranking algorithms for Hamiltonian paths in hypercubic networks | |
Dense bus networks of diameter $2$ | |
On broadcasting schemes in restricted optical passive star systems | |
Restricted routing and wide diameter of the cycle prefix network | |
Permutation routing via Cayley graphs with an example for bus interconnection networks | |
Using helpful sets to improve graph bisections | |
Modification of consecutive-$d$ digraphs | |
Highly adaptive wormhole routing algorithms for $N$-dimensional torus | |
Conflict-free access to constant-perimeter rectangular subarrays | |
Makespan minimization of task graphs with random task running times | |
Scheduling of structured and unstructured computation | |
Routing in optical networks: The problem of contention | |
Communications in optically interconnected parallel computer systems | |
Fault-tolerant Kautz networks | |
Asynchronous packet routers | |
Cayley digraphs of finite cyclic groups with minimal average distance | |
Shuffled tree based fault-tolerant hierarchical interconnection networks | |
Restricted connectivity and restricted fault diameter of some interconnection networks | |
Sorting and selection on interconnection networks | |
Towards a simple construction method for Hamiltonian decomposition of the hypercube | |
Generalized reduced hypercube interconnection networks for massively parallel computers | |
Table of Contents provided by Publisher. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.