An adaptive and cost-optimal parallel algorithm for minimum spanning trees
From MaRDI portal
Recommendations
- A Parallel Algorithm for Computing Minimum Spanning Trees
- scientific article; zbMATH DE number 3956442
- Parallel Algorithms for Minimum Spanning Tree Problem
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe
Cites work
- scientific article; zbMATH DE number 3860407 (Why is no real title available?)
- scientific article; zbMATH DE number 3905859 (Why is no real title available?)
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A parallel algorithm for constructing minimum spanning trees
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Cellular arrays for the solution of graph problems
- Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
- Efficient parallel algorithms for some graph problems
- Expected parallel time and sequential space complexity of graph and digraph problems
- Fast parallel sorting algorithms
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Graph Problems on a Mesh-Connected Processor Array
- Parallel algorithms for the connected components and minimal spanning tree problems
- Parallel computation and conflicts in memory access
Cited in
(14)- scientific article; zbMATH DE number 4011954 (Why is no real title available?)
- scientific article; zbMATH DE number 1629846 (Why is no real title available?)
- Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
- An efficient parallel algorithm for updating minimum spanning trees
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- An I/O efficient algorithm for minimum spanning trees
- A Parallel Algorithm for Computing Minimum Spanning Trees
- scientific article; zbMATH DE number 1556480 (Why is no real title available?)
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe
- Parallel Algorithms for Minimum Spanning Tree Problem
- On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I
- On random and adaptive parallel generation of combinatorial objects
- An adaptive parallel algorithm for analyzing activity networks
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
This page was built for publication: An adaptive and cost-optimal parallel algorithm for minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060018)
