Login / Signup
Computing the Minimum Bottleneck Moving Spanning Tree.
Haitao Wang
Yiming Zhao
Published in:
MFCS (2022)
Keyphrases
</>
spanning tree
edge disjoint
minimum cost
minimum spanning tree
minimum weight
minimum total cost
minimum spanning trees
real time
np hard
approximation algorithms
weighted graph
root node
upper bound
random walk
complex networks
undirected graph