Maintaining a minimum spanning tree under transient node failures
From MaRDI portal
Recommendations
- Nearly linear time minimum spanning tree maintenance for 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
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- Maintaining minimum spanning trees in dynamic graphs
Cited in
(2)
This page was built for publication: Maintaining a minimum spanning tree under transient node failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753951)