Faster Swap Edge Computation in Minimum Diameter Spanning Trees.

Published in: Algorithmica (2012)

Keyphrases

spanning tree
edge disjoint
minimum spanning trees
undirected graph
weighted graph
minimum cost
minimum spanning tree
edge weights
minimum total cost
depth first search
edge detection
edge detector
total length
neural network
memory efficient
graph cuts
simulated annealing
maximum distance
multiscale