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

Abstract Embedding one Interconnection Network in Another. We review results on
embedding network and program structures into popular parallel computer architectures …

In this paper we introduce the notion of the limited-depth minor exclusion and show that
graphs that exclude small limited-depth minors have relatively small separators. In …

We study the problem of on-line job-scheduling on parallel machines with different network
topologies. An on-line scheduling algorithm schedules a collection of parallel jobs with …

We show that for every integer n⩾ 1 n\geqslant1, there exists a graph G n G_n with (1+ o (1))
n (1+o(1))n vertices and n 1+ o (1) n^1+o(1) edges such that every nn‐vertex planar graph is …

This book presents the history and state of the art of universal routing strategies, which can
be applied to networks independently of their respective topologies. It opens with a self …

Parallel algorithms, ie computer operations designed to be performed independently, have
recently increased in importance. Because today's computer applications require more …

How small can a graph be that contains as subgraphs all trees on n vertices with maximum
degree d? In this paper, this question is answered by constructing such universal graphs …

We consider the problem of finding a small set of edges (an edge separator) whose removal
divides a given graph into roughly equal parts. We show that every planar graph with n …

We study the following general online scheduling problem. Parallel jobs arrive dynamically
according to the dependencies between them. Each job requests a certain number of …