On Handling Vertex Deletion in Updating Spanning Trees.

Published in: Inf. Process. Lett. (1988)

Keyphrases

spanning tree
minimum weight
undirected graph
edge disjoint
minimum spanning tree
edge weights
minimum cost
minimum spanning trees
depth first search
weighted graph
data processing
directed graph
upper bound
root node
lowest cost
directed acyclic graph
multimedia
search engine
minimum total cost
neural network