Parallel Algorithms for Minimum Spanning Tree Problem

DOI10.1080/00207160210945zbMATH Open1014.68121OpenAlexW1990039347MaRDI QIDQ4531359FDOQ4531359

Authors:

Publication date: 2 July 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160210945

Recommendations

• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• A Parallel Algorithm for Computing Minimum Spanning Trees
• scientific article; zbMATH DE number 24457
• scientific article; zbMATH DE number 1556480
• An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem

zbMATH Keywords

depth-first searchparallel algorithmsDHEA algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A new algorithm for minimum spanning tree using depth-first-search in an undirected graph
• Minimal spanning trees: An empirical investigation of parallel algorithms

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
• 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
• Title not available (Why is that?)
• Minimal spanning trees: An empirical investigation of parallel algorithms
• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model

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)