scientific article; zbMATH DE number 1556480
From MaRDI portal
Publication:4526020
Recommendations
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- A Parallel Algorithm for Computing Minimum Spanning Trees
- Two minimum spanning forest algorithms on fixed-size hypercube computers
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe
Cited in
(14)- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
- An efficient parallel algorithm for updating minimum spanning trees
- Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
- 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
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
- scientific article; zbMATH DE number 1629846 (Why is no real title available?)
- A data-parallel algorithm for minimum-width tree layout
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe
- scientific article; zbMATH DE number 1305411 (Why is no real title available?)
- scientific article; zbMATH DE number 1161295 (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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526020)
