A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
From MaRDI portal
Publication:2565696
DOI10.1016/J.JPDC.2005.03.011zbMath1101.68106OpenAlexW2028583484WikidataQ56271079 ScholiaQ56271079MaRDI QIDQ2565696
Publication date: 28 September 2005
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.03.011
Related Items (5)
Graph Connectivity in Log Steps Using Label Propagation ⋮ Constructing near spanning trees with few local inspections ⋮ Fast and compact planar embeddings ⋮ Local algorithms for sparse spanning graphs ⋮ A Parallel Edge Orientation Algorithm for Quadrilateral Meshes
This page was built for publication: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)