Independent spanning trees of product graphs

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

Volumn 1197 LNCS, Issue , 1997, Pages 338-351

  Obokata, Koji ^a   Iwasaki, Yukihiro ^a   Bao, Feng ^a   Igarashi, Yoshihide ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT-TOLERANT; GRAPH G; N-CHANNEL; PRODUCT GRAPH; SPANNING TREE;

COMPUTER SCIENCE;

GRAPH THEORY;

EID: 84896755459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62559-3_27     Document Type: Conference Paper

References (7)

1. F. Bao, Y. Igarashi, K. Katano: Broadcasting in hypercubes with randomly distributed Byzantine faults. 9th International Workshop on Distributed Algorithms Le Mont-Saint-Michel LNCS 972 (1995) 215-229
2. F. Bao, Y. Igarashi, S. R. Öhring: Reliable broadcasting in product networks. IEICE Technical Report COMP 95-18 (1995) 57-66
3. J. Cheriyan, S. N. Maheshwari: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9 (1988) 507-537
4. A. Itai, M. Rodeh: The multi-tree approach to reliability in distributed networks. Information and Computation 79 (1988) 43-59
5. S. Khuller, B. Schieber: On independent spanning trees. Information Processing Letters 42 (1992) 321-323
6. A. Youssef: Cartesian product networks, the 1991 International Conference on Parallel Processing I (1991) 684-685
7. A. Zehavi, A. Itai: Three tree-paths. J. Graph Theory 13 (1989) 175-188