Many-to-many disjoint path covers in a graph with faulty elements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 742-753

  Park, Jung Heum ^a   Kim, Hee Chul ^b   Lim, Hyeong Seok ^c  

^a The Catholic University of Korea   (South Korea)

^b Hankuk University of Foreign Studies   (South Korea)

^c Chonnam National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

JOINING; MULTIPROCESSING SYSTEMS;

COVER PROBLEM; DISJOINT PATHS; FAULTY ELEMENTS; FAULTY VERTICES; GRAPH G; MANY TO MANY; PATH COVER; SOURCE-SINK PAIRS; TWO-GRAPHS; VERTEX DISJOINT PATHS; CONSTRUCTION SCHEME; CROSSED CUBES; INTERCONNECTION GRAPHS;

GRAPH THEORY;

EID: 35048880639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_64     Document Type: Article

References (12)

1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, 5th printing, American Elsevier Publishing Co., Inc., 1976.
2. C.C. Chen and J. Chen, "Nearly optimal one-to-many parallel routing in star networks," IEEE Transactions on Parallel and Distributed Systems 8(12), pp. 1196-1202, 1997.
3. S. Gao, B. Novick and K. Qiu, "From hall's matching theorem to optimal routing on hypercubes," Journal of Combinatorial Theory, Series B. 74, pp. 291-301, 1998.
4. Q.P. Gu and S. Peng, "Cluster fault-tolerant routing in star graphs," Networks 35(1), pp. 83-90, 2000.
5. W.T. Huang, M.Y. Lin, J.M. Tan, and L.H. Hsu, "Fault-tolerant ring embedding in faulty crossed cubes," in Proc. SCI'2000, pp. 97-102, 2000.
6. W.T. Huang, J.M. Tan, C.N. Huang, L.H. Hsu, "Fault-tolerant hamiltonicity of twisted cubes," J. Parallel Distrib. Comput. 62, pp. 591-604, 2002.
7. S. Madhavapeddy and I.H. Sudborough, "A topological property of hypercubes: node disjoint paths," in Proc. of the 2th IEEE Symposium on Parallel and Distributed Processing, pp. 532-539, 1990.
8. J.-H. Park, "One-to-one disjoint path covers in recursive circulants," Journal of KISS 30(12), pp. 691-698, 2003 (in Korean).
9. J.-H. Park, "One-to-many disjoint path covers in a graph with faulty elements," in Proc. International Computing and Combinatorics Conference COCOON2004, pp. 392-401, 2004.
10. J.-H. Park and K.Y. Chwa, "Recursive circulants and their embeddings among hypercubes," Theoretical Computer Science 244, pp. 35-62, 2000.
11. C.-H. Tsai, J.J.M. Tan, Y.-C. Chuang, and L.-H. Hsu, "Fault-free cycles and links in faulty recursive circulant graphs," in Proc. of Workshop on Algorithms and Theory of Computation ICS2000, pp. 74-77, 2000.
12. C.-H. Tsai, J.J.M. Tan, and L.-H. Hsu, "The super-connected property of recursive circulant graphs," Inform. Proc. Lett. 91(6), pp. 293-298, 2004.