Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance-Reference-Cited by-同舟云学术

Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance

Published:2002-04 Issue:4 Volume:28 Page:649-666
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Touzene Abderezak

Publisher

Elsevier BV

Subject

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

Reference17 articles.

1. Methods and problems of communication in usual networks;Fraigniaud;Discrete Applied Mathematics,1994

2. Tight bounds for broadcasting the linear cost model;Beauquier;Journal of Interconnection Networks,2001

3. Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks;Perennes;Discrete Applied Mathematics,1998

4. Neighbourhood gossiping in the hypercube;Fujita;Parallel Processing Letters,1998

5. Two edge-disjoint Hamiltonian cycles in the Butterfly graph;Barth;Information Processing Letters,1994

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

1. Edge-disjoint node-independent spanning trees in dense Gaussian networks;The Journal of Supercomputing;2016-06-13

2. Mutually independent hamiltonian cycles of binary wrapped butterfly graphs;Mathematical and Computer Modelling;2008-12

3. Edge-disjoint spanning trees for the generalized butterfly networks and their applications;Journal of Parallel and Distributed Computing;2005-11

4. Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks;Journal of Systems Architecture;2004-03