Author:
Hromkovič Juraj,Klasing Ralf,Monien Burkhard,Peine Regine
Reference43 articles.
1. S.B. Akers, B. Krishnamurthy, “A group-theoretic model for symmetric interconnection networks” , IEEE Transactions on Computers, Vol. 38, No. 4, pp. 555–566, 1989.
2. F. Annexstein, M. Baumslag, A.L. Rosenberg, “Group action graphs and parallel architectures” , SIAM J. Comput., Vol. 19, No. 3, pp. 544–569, 1990.
3. P. Berthomé, A. Ferreira, S. Perennes, “Optimal information dissemination in star and pancake networks” , In: Proc. 5th IEEE Symp. on Parallel and Distributed Processing (SPDP ‘93), 1993, 720–724.
4. J.-C. Bermond, P. Hell, A.L. Liestman, J.G. Peters, “Broadcasting in bounded degree graphs” , SIAM Journal on Discrete Maths. 5, pp. 10–24, 1992.
5. A. Bagchi, S.L. Hakimi, J. Mitchem, E. Schmeichel, “ Parallel algorithms for gossiping by mail” , Inform. Proces. Letters 34 (1990), No. 4, pp. 197–202.
Cited by
68 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Messy Broadcasting in Grid;Algorithms;2024-07-12
2. Optimizing Gossiping for Asynchronous Fault-Prone IoT Networks With Memory and Battery Constraints;IEEE Access;2024
3. Improved Approximation for Broadcasting in k-Path Graphs;Combinatorial Optimization and Applications;2023-12-09
4. Broadcasting in interconnection networks based on node partitioning;2023 IEEE International Mediterranean Conference on Communications and Networking (MeditCom);2023-09-04
5. Broadcasting in chains of rings;2023 Fourteenth International Conference on Ubiquitous and Future Networks (ICUFN);2023-07-04