An O(log n) algorithm for parallel update of minimum spanning trees

DOI10.1016/0020-0190(86)90098-0MaRDI QIDQ1075769zbMATH OpenOpenAlexFDO

Authors I. V. Ramakrishnan, Shaunak R. Pawagi

Publication date 1986

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

Full work available at URL https://doi.org/10.1016/0020-0190(86)90098-0

zbMATH Keywords

graph algorithm

Mathematics Subject Classification ID

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 a Class of Graph Theoretic Problems
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Implementation of simultaneous memory address access in models that forbid it
• On Finding and Updating Spanning Trees and Shortest Paths

Cited in

(7)

• An O(log n) algorithm for parallel update of minimum spanning trees
• On handling vertex deletion in updating minimum spanning trees
• An efficient parallel algorithm for updating minimum spanning trees
• Static and dynamic parallel computation of connected components
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
• Optimal parallel algorithms for multiple updates of minimum spanning trees
• 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: An O(log n) algorithm for parallel update of minimum spanning trees

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