IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Conference Publications > Parallel and Distributed Syst ... Help

An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube

Full Text Sign-In or Purchase

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing! close button
puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ke Qiu ; Dept. of Comput. Sci., Brock Univ., St. Catharines, ON, Canada

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(n3log n)=O(log3NloglogN) time, where N=2n, provided that such disjoint shortest paths exist which can be checked in O(n5/2) time, improving the previous O(n4) routing algorithm.

Published in:
Parallel and Distributed Systems, 2008. ICPADS '08. 14th IEEE International Conference on

Date of Conference: 8-10 Dec. 2008

Page(s):
43 - 47
ISSN :
1521-9097
Print ISBN:
978-0-7695-3434-3
INSPEC Accession Number:
10438425
Conference Location :
Melbourne, VIC
Digital Object Identifier :
10.1109/ICPADS.2008.119
Product Type:
Conference Publications

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.