2026-08-17T15:55:00Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3000 2024-03-06T10:33:42Z ddc:004 open_access

Tight Bounds For Distributed MST Verification Kor, Liah Korman, Amos Peleg, David distributed algorithms distributed verification labeling schemes minimum-weight spanning tree This paper establishes tight bounds for the Minimum-weight Spanning Tree (MST) verification problem in the distributed setting. Specifically, we provide an MST verification algorithm that achieves simultaneously tilde ~O(|E|) messages and $tilde O(sqrt{n} + D) time, where |E| is the number of edges in the given graph G and D is G's diameter. On the negative side, we show that any MST verification algorithm must send Omega(|E|) messages and incur ~Omega(sqrt{n} + D) time in worst case. Our upper bound result appears to indicate that the verification of an MST may be easier than its construction, since for MST construction, both lower bounds of Omega(|E|) messages and Omega(sqrt{n} + D) time hold, but at the moment there is no known distributed algorithm that constructs an MST and achieves simultaneously tilde O(|E|) messages and ´~O(sqrt{n} + D) time. Specifically, the best known time-optimal algorithm (using ~O(sqrt{n} + D) time) requires O(|E|+n^{3/2}) messages, and the best known message-optimal algorithm (using ~O(|E|) messages) requires O(n) time. On the other hand, our lower bound results indicate that the verification of an MST is not significantly easier than its construction. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Liah Kor and Amos Korman and David Peleg 2011 Is Part Of LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2011.69 urn:nbn:de:0030-drops-30000 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.69 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode