An efficient parallel algorithm for updating minimum spanning trees
From MaRDI portal
Publication:1105383
DOI10.1016/0304-3975(88)90035-7zbMath0648.68075MaRDI QIDQ1105383
Peter J. Varman, Kshitij Doshi
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90035-7
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs, Optimal parallel algorithms for multiple updates of minimum spanning trees