Optimal parallel verification of minimum spanning trees in logarithmic time-Reference-Cited by-同舟云学术

Optimal parallel verification of minimum spanning trees in logarithmic time

Published:1997-01 Issue:1 Volume:17 Page:11-18
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Dixon B.,Tarjan R. E.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02523235.pdf

Reference15 articles.

1. N. Alon and B. Schieber, Optimal Preprocessing for Answering On-Line Product Queries, Unpublished manuscript.

2. B. Awerbuch and Y. Shiloach, New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM,IEEE Trans. Comput. 36(10) (1987), 1258–1263.

3. H. Booth and J. Westbrook, Linear Algorithms for Analysis of Minimum Spanning and Shortest Path Trees in Planar Graphs, TR-768, Department of Computer Science, Yale University, Feb. 1990.

4. R. Cole, P. Klein, and R. E. Tarjan, A Linear-work Parallel Algorithm for Finding Minimum Spanning Trees,Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, 1994.

5. B. Dixon, M. Rauch, and R. E. Tarjan, Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time,SIAM J. Comput. 21(6) (1992), 1184–1192.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Log Diameter Rounds MST Verification and Sensitivity in MPC;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Fast and compact self-stabilizing verification, computation, and fault detection of an MST;Distributed Computing;2015-04-30

3. Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification;Theory of Computing Systems;2013-05-15

4. Distributed Minimum Spanning Tree Maintenance for Transient Node Failures;IEEE Transactions on Computers;2012-03

5. Tight Bounds For Distributed MST Verification;LEIBNIZ INT PR INFOR;2011