A Parallel Algorithm for Computing Minimum Spanning Trees
From MaRDI portal
Recommendations
- Improving the efficiency of parallel minimum spanning tree algorithms
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- scientific article; zbMATH DE number 1305411
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest
Cited in
(46)- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
- An efficient parallel algorithm for updating minimum spanning trees
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
- Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
- Improved processor bounds for parallel algorithms for weighted directed graphs
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- A parallel recursive shortest spanning tree algorithm for image segmentation in distributed computing environment
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
- A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest
- Minimal spanning trees: An empirical investigation of parallel algorithms
- Improving the efficiency of parallel minimum spanning tree algorithms
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
- Balancing minimum spanning trees and shortest-path trees
- A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
- Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model
- scientific article; zbMATH DE number 1629846 (Why is no real title available?)
- An efficient parallel algorithm for multiple edge updates of minimum spanning trees on sparse graphs
- An optimal EREW PRAM algorithm for minimum spanning tree verification
- A data-parallel algorithm for minimum-width tree layout
- Listing all the minimum spanning trees in an undirected graph
- scientific article; zbMATH DE number 989224 (Why is no real title available?)
- Computational Methods for Minimum Spanning Tree Algorithms
- scientific article; zbMATH DE number 4199627 (Why is no real title available?)
- An optimal parallel algorithm for minimum spanning trees in planar graphs
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe
- scientific article; zbMATH DE number 4011954 (Why is no real title available?)
- scientific article; zbMATH DE number 24457 (Why is no real title available?)
- scientific article; zbMATH DE number 1234617 (Why is no real title available?)
- scientific article; zbMATH DE number 1305411 (Why is no real title available?)
- scientific article; zbMATH DE number 716158 (Why is no real title available?)
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- scientific article; zbMATH DE number 1556480 (Why is no real title available?)
- Parallel Algorithms for Minimum Spanning Tree Problem
- scientific article; zbMATH DE number 1779563 (Why is no real title available?)
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
- Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract)
- Distributed Computing - IWDC 2003
- Parallel algorithms for geometric graph problems
- A practical minimum spanning tree algorithm using the cycle property
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
- Graph algorithms on a tree-structured parallel computer
- Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
- Recognizing and representing proper interval graphs in parallel using merging and sorting
- Two minimum spanning forest algorithms on fixed-size hypercube computers
This page was built for publication: A Parallel Algorithm for Computing Minimum Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857538)
