Login / Signup
A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon.
Lélia Blin
Fadwa Boubekeur
Swan Dubois
Published in:
IPDPS (2015)
Keyphrases
</>
memory efficient
spanning tree
minimum spanning tree
learning algorithm
computational complexity
edge disjoint
optimal solution
np hard
probabilistic model
minimum cost
depth first search
minimum spanning trees
simulated annealing
iterative deepening
minimum weight