Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
On Disjoint Shortest Paths Routing on the Hypercube
verfasst von : Eddie Cheng, Shuhong Gao, Ke Qiu, Zhizhang Shen
Erschienen in: Combinatorial Optimization and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.