On handling vertex deletion in updating minimum spanning trees

DOI10.1016/0020-0190(88)90020-8MaRDI QIDQ1104108zbMATH OpenOpenAlexFDO

Authors Yung H. 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

incremental algorithmparallel computationparallel graph algorithmupdating of minimum spanning treesvertex deletion

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(1)

• Optimal parallel algorithms for multiple updates of minimum spanning trees

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

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