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
Parallel depth-first search in general directed graphs
SIAM Journal on Computing
Introduction to algorithms
Finding and updating depth-first spanning trees of acyclic digraphs in parallel
The Computer Journal - Special issue on parallel computing
Planar depth-first search in O(log n) parallel time
SIAM Journal on Computing
Linear-processor NC algorithms for planar directed graphs I: strongly connected components
SIAM Journal on Computing
Parallel algorithms for radiation transport on unstructured grids
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Finding strongly connected components in parallel in particle transport sweeps
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Finding strongly connected components in distributed graphs
Journal of Parallel and Distributed Computing
Improved Distributed Algorithms for SCC Decomposition
Electronic Notes in Theoretical Computer Science (ENTCS)
Finding strongly connected components in parallel using O(log2n) reachability queries
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A parallel preconditioning strategy for efficient transistor-level circuit simulation
Proceedings of the 2009 International Conference on Computer-Aided Design
Parallel algorithms for finding SCCs in implicitly given graphs
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
A high-level framework for distributed processing of large-scale graphs
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
HipG: parallel processing of large-scale graphs
ACM SIGOPS Operating Systems Review
An algorithm for enumerating SCCs in web graph
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Expressing graph algorithms using generalized active messages
Proceedings of the 27th international ACM conference on International conference on supercomputing
On fast parallel detection of strongly connected components (SCC) in small-world graphs
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
SCCMulti: an improved parallel strongly connected components algorithm
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
Efficient decomposition of strongly connected components on GPUs
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize. We describe a divide-and-conquer algorithm for this problem which has significantly greater potential for parallelization. For a graph with n vertices in which degrees are bounded by a constant, we sho w the expected serial running time of our algorithm to be O(n log n).