Finding strongly connected components in distributed graphs
From MaRDI portal
Publication:2484293
DOI10.1016/j.jpdc.2005.03.007zbMath1082.68086OpenAlexW2082801772MaRDI QIDQ2484293
Steven J. Plimpton, William III McLendon, Lawrence Rauchwerger, Bruce A. Hendrickson
Publication date: 1 August 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.007
Related Items (5)
A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph ⋮ Digital Bifurcation Analysis of Internet Congestion Control Protocols ⋮ Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components ⋮ Finding strongly connected components of simple digraphs based on granulation strategy ⋮ Parametric Multi-step Scheme for GPU-Accelerated Graph Decomposition into Strongly Connected Components
Uses Software
This page was built for publication: Finding strongly connected components in distributed graphs
