A coarse-grained parallel algorithm for spanning tree and connected components

DOI10.1007/978-3-540-27866-5_110MaRDI QIDQ5311351zbMATH OpenOpenAlexFDO

Authors Frank Dehne, H. Mongelli, Siang W. Song, E. Cáceres, Jayme L. Szwarcfiter

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99409

Mathematics Subject Classification ID

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

Recommendations

• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
• An efficient and fast parallel-connected component algorithm
• Graph algorithms on a tree-structured parallel computer

Cited in

(5)

• A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
• Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
• Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• A parallel algorithm for constructing independent spanning trees in twisted cubes

This page was built for publication: A coarse-grained parallel algorithm for spanning tree and connected components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311351)