Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Algebraic Constructions of Efficient Broadcast Networks
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Towards Optimal Load Balancing Topologies
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Families of Graphs Having Broadcasting and Gossiping Properties
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Diameter of the 2k-node Knödel graph is ⌈(k + 2)/2⌉.