Previous |  Up |  Next


[1] Farley A.M.: Minimum-Time Line Broadcast Networks. Networks, 10:59-70, 1994. MR 0565325
[2] R. Feldmann J. Hromkovič S. Madhavapeddy B. Monien P. Mysliwietz: Optimal algorithms for dissemination of information in generalized communication modes. Discrete Applied Mathematics 53, No. 1-3, 55-78, 1994. DOI 10.1016/0166-218X(94)90179-1 | MR 1291002
[3] P. Fraigniaud E. Lazard: Methods and problems of communication in usual networks. Discrete Applied Mathematics 53, No. 1-3, 79-133, 1994. DOI 10.1016/0166-218X(94)90180-5 | MR 1291003
[4] S. M. Hedetniemi S. T. Hedetniemi A. L. Liestman: A Survey of Gossiping and Broadcasting in Communication Networks. Networks, 18:319-349, 1998.
[5] J. Hromkovič R. Klasing B. Monien R. Peine: Dissemination of information in interconnection networks (broadcasting and gossiping). In: D.-Z. Du and F. Hsu, editors, Combinatorial Network Theory, Kluwer Academic Publishers, 125-212, 1995. MR 1382871
[6] J. Hromkovič R. Klasing E.A. Stöhr: Dissemination of Information in Vertex- Disjoint Paths Mode. Computers and Artificial Intelligence, Vol. 15, No. 4, 295-318, 1996. MR 1424352
[7] Hromkovič J., Klasing R., Stöhr E. A., Wagener H.: Gossiping in Vertex- Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. Information and Computation 123, No. 1, pp. 17-28, 1995. DOI 10.1006/inco.1995.1154 | MR 1358964
[8] J. Hromkovič R. Klasing W. Unger H. Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Information and Computation (to appear). MR 1436767
[9] J. Hromkovič K. Lorys P. Kanarek R. Klasing W. Unger H. Wagener: On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. Proc of the 12th Symposium on Theoretical Aspects of Computer Science (STACS'95), Springer LNCS 900, pp. 255-266.
[10] R. Klasing: The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. Proc. of the 19th International Symposium on Mathematical Foundations of Computer Science (MFCS'94), Springer LNCS 841, pp. 473-483. Discrete Applied Mathematics, to appear.
[11] R. Klasing: On the Complexity of Broadcast and Gossip in Different Communication Modes. Shaker Verlag, Aachen, 1996.
Partner of
EuDML logo