The pancake problem, which has attracted considerable attention [10, 12, 9, 15], concerns the number of prefix reversals or flips needed to sort the elements of an arbitrary permutation. The number… (More)

Since Qn, the hypercube of dimension n, is known to have n linkdisjoint paths between any two nodes, the links of Qn can be partitioned into multiple link-disjoint spanning subnetworks, or factors.… (More)

The links of the hypercube Qn can be partitioned into multiple link-disjoint spanning subnetworks, or factors. Each of these factors could simulate Qn. We therefore identify k-factorizations, or… (More)

The binary hypercube Qn has small diameter, but a relatively large number of links. Because of this, efforts have been made to determine the maximum number of links that can be deleted without… (More)

The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of… (More)

With the rapid growth of weblogs (or “blogs”) over the past year, users require a way of rapidly accessing recent content from many different websites. Traditional websites are inadequate for this,… (More)