One-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 3106, Issue , 2004, Pages 392-401

  Park, Jung Heum ^a  

^a The Catholic University of Korea   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

JOINING; MULTIPROCESSING SYSTEMS;

CONSTRUCTION SCHEME; CROSSED CUBES; DISJOINT PATHS; FAULTY ELEMENTS; FAULTY VERTICES; INTERCONNECTION GRAPHS; SINGLE SOURCE; TWISTED CUBE;

GRAPH THEORY;

EID: 35048892597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_42     Document Type: Article

References (7)

1. D.-R. Duh and G.-H. Chen, "On the Rabin number problem," Networks 30(3), pp. 219-230, 1997.
2. F. Harary and M. Lewinter, "The starlike trees which span a hypercube," Computers & Mathematics with Applications 15(4), pp. 299-302, 1988.
3. 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.
4. 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.
5. J.-H. Park, "One-to-one disjoint path covers in recursive circulants," Journal of KISS 30(12), pp. 691-698, 2003 (in Korean).
6. J.-H. Park and K.Y. Chwa, "Recursive circulants and their embeddings among hypercubes," Theoretical Computer Science 244, pp. 35-62, 2000.
7. C.-H. Tsai, 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.