Constructing Near Spanning Trees with Few Local Inspections.

Reut Levi Guy Moshkovitz Dana Ron Ronitt Rubinfeld Asaf Shapira

Published in: CoRR (2015)

Keyphrases

spanning tree
edge disjoint
minimum cost
minimum spanning tree
minimum spanning trees
minimum weight
undirected graph
defect detection
random walk
total length
weighted graph
experimental design
root node
edge weights
high dimensional
shortest path
markov chain
np hard