Nearly linear time minimum spanning tree maintenance for transient node failures
From MaRDI portal
Recommendations
- Maintaining a minimum spanning tree under transient node failures
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
- Reconstructing a minimum spanning tree after deletion of any node
- Maintenance of a minimum spanning forest in a dynamic plane graph
- scientific article; zbMATH DE number 1185590
Cited in
(9)- An improved algorithm for computing all the best swap edges of a tree spanner
- Faster swap edge computation in minimum diameter spanning trees
- Exact and approximate truthful mechanisms for the shortest paths tree problem
- Maintaining a minimum spanning tree under transient node failures
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
- Inclusion of isolated nodes into the minimum spanning tree of an ad-hoc wireless sensor network
- scientific article; zbMATH DE number 1185590 (Why is no real title available?)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
- Linear time distributed swap edge algorithms
This page was built for publication: Nearly linear time minimum spanning tree maintenance for transient node failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882530)