Parallel algorithms for finding SCCs in implicitly given graphs

Authors:
Jiří Barnat;Pavel Moravec
Affiliations:
Department of Computer Science, Faculty of Informatics, Masaryk University Brno, Czech Republic;Department of Computer Science, Faculty of Informatics, Masaryk University Brno, Czech Republic
Venue:
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Year:
2006

Citing 12
Cited 4

An improved parallel algorithm that computes the BFS numbering of a directed graph

Information Processing Letters
Faster optimal parallel prefix sums and list ranking

Information and Computation
Improved processor bounds for parallel algorithms for weighted directed graphs

Information Processing Letters
Model checking

Model checking
Parallel state space construction for model-checking

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
On Identifying Strongly Connected Components in Parallel

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Is There a Best Symbolic Cycle-Detection Algorithm?

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Parallel State Space Exploration for GSPN Models

Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Parallelizing the Murphi Verifier

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Distributed State Space Generation of Discrete-State Stochastic Models

INFORMS Journal on Computing
Finding strongly connected components in distributed graphs

Journal of Parallel and Distributed Computing
DiVinE: a tool for distributed verification

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

Improved Distributed Algorithms for SCC Decomposition

Electronic Notes in Theoretical Computer Science (ENTCS)
Scalable Multi-core Model Checking Fairness Enhanced Systems

ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A Quantized Boundary Representation of 2D Flows

Computer Graphics Forum
Efficient decomposition of strongly connected components on GPUs

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine existing parallel algorithms for detection of strongly connected components and discuss their applicability to the case when the graph to be decomposed is given implicitly. In particular, we list individual techniques that parallel algorithms for SCC detection are assembled from and show how to assemble a new more efficient algorithm for solving the problem. In the paper we also report on a preliminary experimental study we did to evaluate the new algorithm.