This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [5]. We provide code for aâ€¦ (More)

In this paper we present a general strategy for finding efficient permutation routes in parallel networks. Among the popular parallel networks to which the strategy applies are mesh networks,â€¦ (More)

A unified framework for finding efficient permutation routes on parallel networks in an off-line setting is presented. If the underlying graph of a parallel network contains an appropriateâ€¦ (More)

We present algbri~hms which reconfigure faulty deBruijn and Butterfly networks. We show that, with high probability, an N-node deBruijn (resp., Butterfly) network with uniformly distributed faultyâ€¦ (More)

We propose a mathematical model for fault-tolerant routing based on acyclic orientations, or acorns, of the underlying network G = (V; E). The acorn routing model applies routing tables that storeâ€¦ (More)

Anxrn(O, l)-matrix is said to satisfy the corasecutive-oneu property if there is a permutation of the rows of the matrix such that in each column all non-zero entries are adjacent. The problem ofâ€¦ (More)

A pair of spanning trees rooted at a vertex r are independent if for every vertex v the pair of unique tree paths from v to the root r are disjoint. This paper presents the rst analysis of the pathâ€¦ (More)

We present bounds on two combinatorial properties of Cayley graphs in terms relating to the structure of their underlying group, Included in this work is a presentation of lower bounds on theâ€¦ (More)