Author:
Bui Marc,Butelle Franck,Lavault Christian
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference18 articles.
1. Complexity of network synchronization;Awerbuch;J. ACM,1985
2. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree counting, leader election and related problems, Proceedings of ACM STOC, 1987, pp. 230–240.
3. B. Awerbuch, I. Cidon, S. Kutten, Communication-optimal maintenance of replicated information, Proceedings of IEEE FOCS, 1990, pp. 492–502.
4. Data Networks;Bertsekas,1992
5. M. Bui, F. Butelle, Minimum diameter spanning tree, Proceedings of the International Workshop on Principles of Parallel Computing (OPOPAC’93), Hermès & Inria, Lacanau, France, 1993, pp. 37–46.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Diameter-Constrained Minimum Spanning Tree Problems: A Survey;2023 International Conference on Information Technology (ICIT);2023-08-09
2. A Simple Efficient Policy to Reduce Broadcast Redundancy in Wired Networks;2022 IEEE 10th International Conference on Information, Communication and Networks (ICICN);2022-08-23
3. Distributed Algorithms for Average Consensus of Input Data With Fast Convergence;IEEE Transactions on Systems, Man, and Cybernetics: Systems;2021-05
4. A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem;Theoretical Computer Science;2020-11
5. Minimum Diameter Vertex-Weighted Steiner Tree;Algorithmic Aspects in Information and Management;2020