Author:
Ahlswede R.,Haroutunian H. S.,Khachatrian L. H.
Reference9 articles.
1. A. Farley, S. Hedetniemi, S. Mitchell, and A. Proskurowski, “Minimum broadcast graphs”, Discrete Math. 25, 189–193, 1979.
2. L.H. Khachatrian and H.S. Haroutunian, “Construction of new classes of minimal broadcast networks”Proc. of the third International Colloquium on Coding TheoryDilijan, 69–77, 1990.
3. M.J. Dinneen, M.R. Fellows, and V. Faber, “Algebraic constructions of effecient broadcast networks”, Applied Algebra, Algebraic Algorithms and Error Correcting Codes, 9. Lecture Notes in Computer Science 539, 152–158, 1991.
4. J.C. Bermond, P. Hell, A.L. Liestman, and G. Peters, “Sparse broadcast graphs”Discrete Appl. Math. 3697–130, 1992.
5. M. Mahéo and J.F. Saclé, “Some minimum broadcast graphs”Technical Report 685LRI, Université de Paris—Sud, 1991.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal Broadcasting in Fully Connected Trees;Journal of Interconnection Networks;2022-08-05
2. Broadcast Graphs with Nodes of Limited Memory;Complex Networks XIII;2022
3. Odd gossiping;Discrete Applied Mathematics;2017-01
4. The Worst Case Behavior of Randomized Gossip;Lecture Notes in Computer Science;2012
5. AVERAGE-CASE "MESSY" BROADCASTING;Journal of Interconnection Networks;2008-12