Optimal parallel algorithms for multiple updates of minimum spanning trees
From MaRDI portal
Publication:2366226
DOI10.1007/BF01228509zbMath0768.68027MaRDI QIDQ2366226
Publication date: 29 June 1993
Published in: Algorithmica (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (3)
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 ⋮ Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- 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
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- On handling vertex deletion in updating minimum spanning trees
- An efficient parallel algorithm for updating minimum spanning trees
- Algorithms for updating minimal spanning trees
- Efficient parallel algorithms for graph problems
- Optimal parallel algorithms for multiple updates of minimum spanning trees
- An Efficient Parallel Biconnectivity Algorithm
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Efficient parallel algorithms for some graph problems
- An O(logn) parallel connectivity algorithm
- On Finding and Updating Spanning Trees and Shortest Paths
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
This page was built for publication: Optimal parallel algorithms for multiple updates of minimum spanning trees
