Distributed algorithms for SCC decomposition

DOI10.1093/LOGCOM/EXP003MaRDI QIDQ3069996zbMATH OpenOpenAlexWikidataFDO

Authors J. Barnat, Jakub Chaloupka, Jaco van de Pol

Publication date 2 February 2011

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/distributed-algorithms-for-scc-decomposition(91eabb57-5738-4487-a304-2645ee698003).html

zbMATH Keywords

parallel algorithmsstrongly connected components

Mathematics Subject Classification ID

Connectivity (05C40) Parallel algorithms in computer science (68W10)

Recommendations

• Improved distributed algorithms for SCC decomposition
• Finding strongly connected components in distributed graphs
• scientific article; zbMATH DE number 5879017
• I/O- and CPU-optimal recognition of strongly connected components
• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components

Cited in

(11)

• Computation of Lyapunov functions for systems with multiple local attractors
• Distributed disassembly of mosaics
• scientific article; zbMATH DE number 7566051 (Why is no real title available?)
• Symbolic coloured SCC decomposition
• Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
• Parametric multi-step scheme for GPU-accelerated graph decomposition into strongly connected components
• Digital bifurcation analysis of Internet congestion control protocols
• Dynamical modeling and analysis of large cellular regulatory networks
• Improved distributed algorithms for SCC decomposition
• A truly symbolic linear-time algorithm 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

• DiVinE

This page was built for publication: Distributed algorithms for SCC decomposition

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