The authors develop an algebraic framework that exposes the structural kinship among the
deBruijn, shuffle-exchange, butterfly, and cube-connected cycles networks and illustrate …

The recently introduced interconnection network, crossed cube, has attracted much attention
in the parallel processing area due to its many attractive features. Like the ordinary …

We propose an interconnection structure for multicomputer networks, called recursive
circulant. Recursive circulant G (N, d) is defined to be a circulant graph with N nodes and …

Graph Separators with Applications is devoted to techniques for obtaining upper and lower
bounds on the sizes of graph separators-upper bounds being obtained via decomposition …

We study Hamiltonicity in random subgraphs of the hypercube $\mathcal {Q}^ n $. Our first
main theorem is an optimal hitting time result. Consider the random process which includes …

We present an embedding of generalized ladders as subgraphs into the hypercube.
Through an embedding of caterpillars into ladders, we obtain an embedding of caterpillars …

We present a new, efficient and easy to use collision detection scheme for real-time collision
detection between highly deformable tetrahedral models. Tetrahedral models are a common …

The minimum linear arrangement problem is a combinatorial optimization problem whose
goal is to find a linear layout of a network in such way that a certain objective cost function is …

Most of the articles in this book deal with static or point-to-pointInterconnection Networks. In
particular, new constructions are proposed basedon different tools from discrete …

This article focuses on principles for the design of efficient parallel algorithms for distributed
memory computing systems. We describe the general trend in the development of …