Reconstructing a minimum spanning tree after deletion of any node

DOI10.1007/s00453-001-0061-3zbMath0997.68006OpenAlexW1501146038MaRDI QIDQ5953599

No author found.

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

minimum spanning treeCREW PRAMnode deletionnode replacement

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

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

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