C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures.
Enrico Nardelli
Guido Proietti
Peter Widmayer
Published in:
Algorithmica (2004)
Keyphrases
</>
minimum spanning tree
node failures
spanning tree
fault tolerance
graph theory
traveling salesman problem
weighted graph
congestion control
overlay network
data replication
worst case
fault tolerant
ant colony optimization
shortest path
peer to peer
load balancing
end to end