Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph (Q2501326): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-006-0035-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1988487508
@@ Property / OpenAlex ID: W1988487508 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing a minimum spanning tree after deletion of any node
+Normal rank
@@ Property / cites work @@
+Algorithms for updating minimal spanning trees
@@ Property / cites work: Algorithms for updating minimal spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding and Updating Spanning Trees and Shortest Paths
+Normal rank
@@ Property / cites work @@
+An O(log n) algorithm for parallel update of minimum spanning trees
+Normal rank
@@ Property / cites work @@
+An efficient parallel algorithm for updating minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
+Normal rank
@@ Property / cites work @@
+Optimal parallel algorithms for multiple updates of minimum spanning trees
+Normal rank
@@ Property / cites work @@
+A comparison of associative computation models
@@ Property / cites work: A comparison of associative computation models / rank @@
+Normal rank
@@ Property / cites work @@
+Q4507825
@@ Property / cites work: Q4507825 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5711259
@@ Property / cites work: Q5711259 / rank @@
+Normal rank