Advertisement
Published in:
2009 | OriginalPaper | Chapter
On Disjoint Shortest Paths Routing on the Hypercube
Authors : Eddie Cheng, Shuhong Gao, Ke Qiu, Zhizhang Shen
Published in: Combinatorial Optimization and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We present a routing algorithm that finds
n
disjoint shortest paths from the source node to
n
target nodes in the
n
-dimensional hypercube in
O
(
n
3
) =
O
(log
3
N
) time, where
N
= 2
n
, provided that such disjoint shortest paths exist which can be verified in
O
(
n
5/2
) time, improving the previous
O
(
n
3
log
n
) routing algorithm. In addition, the development of this algorithm also shows strong relationship between the problems of the disjoint shortest paths routing and matching.