Discrete Applied Mathematics, Volume 53

Volume 53, Numbers 1-3, September 1994

• Jehoshua Bruck: On optimal broadcasting in faulty hypercubes. 3-13
• Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Fast gossiping with short unreliable messages. 15-24
• Selma Djelloul: Broadcasting in m-dimensional grid graphs with a given neighborhood template. 25-36
• Arthur M. Farley, Andrzej Proskurowski: Bounded-call broadcasting. 37-53
• Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz: Optimal algorithms for dissemination of information in generalized communication modes. 55-78
• Pierre Fraigniaud, Emmanuel Lazard: Methods and problems of communication in usual networks. 79-133
• Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards: Reliable broadcasting. 135-148
• Alexandros V. Gerbessiotis: Broadcasting in random graphs. 149-170
• Chandra Gowri Sankaran: Broadcasting on recursively decomposable Cayley graphs. 171-182
• Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr: Broadcasting in Butterfly and deBruijn Networks. 183-197
• Jean-Claude König, Emmanuel Lazard: Minimum k-broadcast graphs. 199-209
• Guy Kortsarz, David Peleg: Traffic-light scheduling on the grid. 211-234
• Roger Labahn, Stephen T. Hedetniemi, Renu Laskar: Periodic gossiping on trees. 235-245
• Roger Labahn: A minimum broadcast graph on 63 vertices. 247-250
• S. Lennart Johnsson, Ching-Tien Ho: Optimal communication channel utilization for matrix transposition and related permutations on binary cubes. 251-274
• Maryvonne Mahéo, Jean-François Saclé: Some minimum broadcast graphs. 275-285
• Maryvonne Mahéo, Jean-François Saclé: Note on the problem of gossiping in multidimensional grids. 287-290
• Philippe Michallon, Denis Trystram: Practical experiments of broadcasting algorithms on a configurable parallel computer. 291-298
• Krishnamurthi Ravishankar, Suresh Singh: Broadcasting on [0, L]. 299-319
• Frances L. Van Scoy, Jeffrey A. Brooks: Broadcasting multiple messages in a grid. 321-336