Reconstructing a minimum spanning tree after deletion of any node

DOI10.1007/S00453-001-0061-3MaRDI QIDQ5953599zbMATH OpenOpenAlexFDO

Authors B. Das, Michael C. Loui

Publication date 24 January 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0061-3

zbMATH Keywords

CREW PRAMminimum spanning treenode deletionnode replacement

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1185590
• scientific article; zbMATH DE number 1156650
• A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
• Reconfiguring minimum dominating sets in trees
• Minimum spanning trees in d dimensions
• scientific article; zbMATH DE number 1436136
• Minimum spanning hypertrees
• scientific article; zbMATH DE number 3948324
• Minimum spanning trees

Cited in

(9)

• Nearly linear time minimum spanning tree maintenance for transient node failures
• Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
• Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph
• scientific article; zbMATH DE number 1670672 (Why is no real title available?)
• Inclusion of isolated nodes into the minimum spanning tree of an ad-hoc wireless sensor network
• Algorithms for Single Link Failure Recovery and Related Problems
• scientific article; zbMATH DE number 1185590 (Why is no real title available?)
• scientific article; zbMATH DE number 1156650 (Why is no real title available?)
• Fast reoptimization for the minimum spanning tree problem

This page was built for publication: Reconstructing a minimum spanning tree after deletion of any node

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953599)