On handling vertex deletion in updating minimum spanning trees

DOI10.1016/0020-0190(88)90020-8zbMath0646.68083OpenAlexW1561849018MaRDI QIDQ1104108

Yung Hyang Tsin

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90020-8

zbMATH Keywords

parallel computationincremental algorithmvertex deletionparallel graph algorithmupdating of minimum spanning trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Optimal parallel algorithms for multiple updates of minimum spanning trees

Cites Work

• An O(log n) algorithm for parallel update of minimum spanning trees
• Algorithms for updating minimal spanning trees
• Efficient parallel algorithms for some graph problems

This page was built for publication: On handling vertex deletion in updating minimum spanning trees