Finding strongly connected components in distributed graphs

DOI10.1016/J.JPDC.2005.03.007MaRDI QIDQ2484293zbMATH OpenOpenAlexFDO

Authors William III McLendon, Steven J. Plimpton, 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

zbMATH Keywords

Parallel computingGraph algorithmStrongly connected components

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5879017
• Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
• scientific article; zbMATH DE number 1057773
• An efficient and fast parallel-connected component algorithm
• scientific article; zbMATH DE number 1844551

Cited in

(10)

• Distributed Strong Diameter Network Decomposition
• Path-based depth-first search for strong and biconnected components
• A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
• Distributed algorithms for SCC decomposition
• Parametric multi-step scheme for GPU-accelerated graph decomposition into strongly connected components
• scientific article; zbMATH DE number 5879017 (Why is no real title available?)
• Finding strongly connected components of simple digraphs based on granulation strategy
• Digital bifurcation analysis of Internet congestion control protocols
• Improved distributed algorithms for SCC decomposition
• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components

Describes a project that uses

Uses Software

• PMESC

This page was built for publication: Finding strongly connected components in distributed graphs

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