An adaptive and cost-optimal parallel algorithm for minimum spanning trees
From MaRDI portal
Publication:1060018
DOI10.1007/BF02240073zbMath0567.68041MaRDI QIDQ1060018
Publication date: 1986
Published in: Computing (Search for Journal in Brave)
Related Items
On random and adaptive parallel generation of combinatorial objects, An adaptive parallel algorithm for analyzing activity networks, On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel algorithms for the connected components and minimal spanning tree problems
- Parallel computation and conflicts in memory access
- Expected parallel time and sequential space complexity of graph and digraph problems
- Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Graph Problems on a Mesh-Connected Processor Array
- A parallel algorithm for constructing minimum spanning trees
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Efficient parallel algorithms for some graph problems
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Fast parallel sorting algorithms
- Cellular arrays for the solution of graph problems
