Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph
From MaRDI portal
Publication:2501326
DOI10.1007/s10559-006-0035-1zbMath1102.68136OpenAlexW1988487508MaRDI QIDQ2501326
Publication date: 6 September 2006
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-006-0035-1
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Unnamed Item
- Unnamed Item
- An O(log n) algorithm for parallel update of minimum spanning trees
- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
- An efficient parallel algorithm for updating minimum spanning trees
- Algorithms for updating minimal spanning trees
- 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
- On Finding and Updating Spanning Trees and Shortest Paths
- A comparison of associative computation models
- Reconstructing a minimum spanning tree after deletion of any node