Parallel Algorithms for Minimum Spanning Tree Problem
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- An adaptive and cost-optimal parallel algorithm for 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
- Minimal spanning trees: An empirical investigation of parallel algorithms
- 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?)
- scientific article; zbMATH DE number 4011954 (Why is no real title available?)
- scientific article; zbMATH DE number 1985713 (Why is no real title available?)
- Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
This page was built for publication: Parallel Algorithms for Minimum Spanning Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531359)