An efficient algorithm for k-pairwise disjoint paths in star graphs

Information Processing Letters

Volumn 67, Issue 6, 1998, Pages 283-287

  Gu, Qian Ping ^a   Peng, Shietung ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

Disjoint paths; Interconnection networks; Off line routing algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTERCONNECTION NETWORKS;

DISJOINT PATH PROBLEMS; STAR GRAPHS;

GRAPH THEORY;

EID: 0032155674     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00121-5     Document Type: Article

References (15)

1. S.B. Akers, B. Krishnamurthy, A group theoretic model for symmetric interconnection networks, IEEE Trans. Comput. 38 (1989) 555-566.
2. J.C. Bermond (Ed.), Interconnection networks, Discrete Appl. Math. (Special Issue) (1992).
3. K. Day, A. Tripathi, A comparative study of topological properties of hypercubes and star graphs, IEEE Trans. Parallel Distrib. Systems 5 (1) (1994) 31-38.
4. M. Dietzfelbinger, S. Madhavapeddy, I.H. Sudborough, Three disjoint path paradigms in star networks, in: Proc. IEEE Symposium on Parallel and Distributed Processing, 1991, pp. 400-406.
5. F. Fragopoulou, S.G. Akl, Optimal communication algorithms on star graphs using spanning tree constructions, J. Parallel Distrib. Comput. 24 (1995) 55-71.
6. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
7. Q. Gu, S. Peng, Node-to-node cluster fault tolerant routing in star graphs, Inform. Process. Lett. 56 (1995) 29-35.
8. Q. Gu, S. Peng, k-pairwise cluster fault tolerant routing in hypercubes, IEEE Trans. Comput. 46 (9) (1997) 1042-1049.
9. Q. Gu, S. Peng, Node-to-set disjoint paths problem in star graphs, Inform. Process. Lett. 62 (1997) 201-207.
10. D.F. Hsu, Interconnection networks and algorithms, Networks (Special Issue) 23 (4) (1993).
11. D.F. Hsu, On container with width and length in graphs, groups, and networks, IEICE Trans. Fundamentals of Electronics, Information, and Computer Sciences E77-A (4) (1994) 668-680.
12. R.M. Karp, On the computational complexity of combinatorial problems, Networks 5 (1975) 45-68.
13. S. Madhavapeddy, I.H. Sudborough, A topological property of hypercubes: Node disjoint paths, in: Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, 1990, pp. 532-539.
14. Y. Shiloach, The two paths problem is polynomial, Technical Report STAN-CS-78-654, Stanford University, 1978.
15. M. Watkin, On the existence of certain disjoint arcs in graphs, Duke Math. J. (1968).