Methods and problems of communication in usual networks
- 14 September 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 53 (1-3), 79-133
- https://doi.org/10.1016/0166-218x(94)90180-5
Abstract
No abstract availableKeywords
This publication has 67 references indexed in Scilit:
- Fast gossiping on square mesh computersInformation Processing Letters, 1993
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2Information Processing Letters, 1993
- The cost of broadcasting on star graphs and k-ary hypercubesIEEE Transactions on Computers, 1993
- Network communication in edge-colored graphs: gossipingIEEE Transactions on Parallel and Distributed Systems, 1993
- Optimal algorithms for total exchange without buffering on the hypercubeBIT Numerical Mathematics, 1992
- Optimal broadcasting on the star graphIEEE Transactions on Parallel and Distributed Systems, 1992
- Broadcasting in the Butterfly networkInformation Processing Letters, 1991
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South StreetsNetworks, 1989
- New gossips and telephonesDiscrete Mathematics, 1975