An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube

Authors:
Ke Qiu
Affiliations:
-
Venue:
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
Year:
2008

Citing 0
Cited 2

On Disjoint Shortest Paths Routing on the Hypercube

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 \log n)$ = $O(\log^3 N \log\log N)$ time, where $N = 2^n$, provided that such disjoint shortest paths exist which can be checked in $O(n^{5/2})$ time, improving the previous $O(n^4)$ routing algorithm.