default search action
Discrete Applied Mathematics, Volume 83
Volume 83, Numbers 1-3, March 1998
- Feng Bao, Yoshihide Igarashi, Sabine R. Öhring:
Reliable broadcasting in product networks. 3-20 - Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung:
Embedding ladders and caterpillars into the hypercube. 21-29 - Francesc Comellas, Margarida Mitjana:
Broadcasting in cycle prefix digraphs. 31-39 - Kuo-Shun Ding, Ching-Tien Ho, Jyh-Jong Tsay:
Matrix transpose on meshes with wormhole and XY routing. 41-59 - Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski:
Minimum-time multidrop broadcast. 61-77 - Paraskevi Fragopoulou, Selim G. Akl:
Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks. 79-96 - Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Minimum time broadcast in faulty star networks. 97-119 - Leszek Gasieniec, Andrzej Pelc:
Broadcasting with linearly bounded transmission faults. 121-133 - Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Cycles in the cube-connected cycles graph. 135-155 - Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks:
Optimal layouts on a chain ATM network. 157-178 - Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
The complexity of broadcasting in planar and decomposable graphs. 179-206 - Jave O. Kane, Joseph G. Peters:
Line broadcasting in cycles. 207-228 - Ralf Klasing:
The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width. 229-246 - Stephane Perennes:
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. 247-262 - Aditya Shastri:
Time-relaxed broadcasting in communication networks. 263-278 - Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann:
Uniform homomorphisms of de Bruijn and Kautz networks. 279-301 - Emmanouel A. Varvarigos:
Optimal communication algorithms for Manhattan Street networks. 303-326
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.