Parametric multi-step scheme for GPU-accelerated graph decomposition into strongly connected components

DOI10.1007/978-3-319-58943-5_42MaRDI QIDQ5862566zbMATH OpenOpenAlexFDO

Authors Stefano Aldegheri, J. Barnat, Nicola Bombieri, Federico Busato, Milan Češka

Publication date 9 March 2022

Published in Euro-Par 2016: Parallel Processing Workshops (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-58943-5_42

zbMATH Keywords

coloring algorithmextensive experimental evaluationgraph traversalkernel calltrivial component

Mathematics Subject Classification ID

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

Recommendations

• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
• Distributed algorithms for SCC decomposition
• I/O- and CPU-optimal recognition of strongly connected components
• Symbolic coloured SCC decomposition
• Parallel graph component labelling with GPUs and CUDA

Cites work

• Depth-First Search and Linear Graph Algorithms
• Finding strongly connected components in distributed graphs
• scientific article; zbMATH DE number 5610761 (Why is no real title available?)
• The University of Florida sparse matrix collection

Cited in

(1)

• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components

Describes a project that uses

Uses Software

• GTgraph

This page was built for publication: Parametric multi-step scheme for GPU-accelerated graph decomposition into strongly connected components

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