Petr Salinger, Pavel Tvrdík Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing. [Citation Graph (0, 0)][DBLP] Parallel Computing, 2002, v:28, n:4, pp:627-647 [Journal]
Abderezak Touzene Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance. [Citation Graph (0, 0)][DBLP] Parallel Computing, 2002, v:28, n:4, pp:649-666 [Journal]