Parallel Algorithms for Minimum Spanning Tree Problem

DOI10.1080/00207160210945zbMATH Open1014.68121OpenAlexW1990039347MaRDI QIDQ4531359

No author found.

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

zbMATH Keywords

parallel algorithmsdepth-first searchDHEA algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Related Items (2)

Unnamed Item ⋮ An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem

This page was built for publication: Parallel Algorithms for Minimum Spanning Tree Problem