If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

From Hall's Matching Theorem to Optimal Routing on Hypercubes

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.

Abstract:

We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the sets. It is shown that disjoint ordering is useful for network routing. More precisely, we show that Hall's “marriage” condition for a collection of finite sets guarantees the existence of a disjoint ordering for the sets. We next use this result to solve a problem in optimal routing on hypercubes. We give a necessary and sufficient condition under which there are internally node-disjoint paths each shortest from a source node to any other s(sn) target nodes on an n-dimensional hypercube. When this condition is not necessarily met, we show that there are always internally node-disjoint paths each being either shortest or near shortest, and the total length is minimum. An efficient algorithm is also given for constructing disjoint orderings and thus disjoint short paths. As a consequence, Rabin's information disposal algorithm may be improved. Copyright 1998 Academic Press.

Document Type: Research Article

Affiliations: 1: Department of Mathematical Sciences, Clemson University, Clemson, South Carolina, 29634-1907 2: Jodrey School of Computer Science, Acadia University, Nova Scotia, Canada

Publication date: November 1, 1998

Related content

Tools

Favourites

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more