Efficient parallel graph algorithms for coarse-grained multicomputers and BSP

DOI10.1007/s00453-001-0109-4zbMath0994.68177OpenAlexW2012042319MaRDI QIDQ1601013

Alessandro Roncato, Siang W. Song, E. N. Cáceres, Afonso G. Ferreira, Frank Dehne

Publication date: 17 June 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0109-4

zbMATH Keywords

graph algorithmscoarse grained parallel computing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

A bridging model for multi-core computing ⋮ Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search

This page was built for publication: Efficient parallel graph algorithms for coarse-grained multicomputers and BSP