n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices-Reference-Cited by-同舟云学术

n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices

Published:2004-08 Issue:8 Volume:30 Page:973-998
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Gonzalez Teofilo F.,Serena David

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference16 articles.

1. From Hall’s matching theorem to optimal routing on hypercubes;Gao;Journal of Combinatorial Theory Series B,1998

2. T.F. Gonzalez, F.D. Serena, Node disjoint shortest paths for pairs of vertices in an n-cube network, in: Proceedings of the International Conference on Parallel and Distributed Computing and Systems (PDCS2001) (2001), IASTED, pp. 278–282

3. T.F. Gonzalez, F.D. Serena, Complexity of k-pairwise disjoint shortest paths in the hypercube and grid networks. Technical Report TRCS-2002-14, University of California at Santa Barbara, May 2002

4. T.F. Gonzalez, F.D. Serena, Complexity of k-pairwise disjoint shortest paths in the undirected hypercubic network and related problems, in: Proceedings of the International Conference on Parallel and Distributed Computing and Systems (PDCS 2002), IASTED, 2002

5. n-Cube search algorithm for finding (n−1)-pairwise node disjoint shortest paths;Gonzalez,2002

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Faster Algorithm for Finding Disjoint Ordering of Sets;International Journal of Networking and Computing;2013

2. A Faster Algorithm for Finding Disjoint Ordering of Sets;2012 Third International Conference on Networking and Computing;2012-12

3. Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications;IEEE Transactions on Parallel and Distributed Systems;2012-06

4. Two conditions for reducing the maximal length of node-disjoint paths in hypercubes;Theoretical Computer Science;2012-02

5. Disjoint paths in hypercubes with prescribed origins and lengths;International Journal of Computer Mathematics;2010-07