Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification.

Liah Kor Amos Korman David Peleg

Published in: Theory Comput. Syst. (2013)

Keyphrases

minimum weight
spanning tree
tight bounds
upper bound
minimum spanning tree
bipartite graph
greedy heuristic
weighted graph
minimum cost
minimum spanning trees
tree patterns
randomized algorithm
dynamic programming
edge weights
approximation algorithms
probabilistic model
np hard