On the Strongly Connected and Biconnected Components of the Complement of Graphs (original) (raw)
Related papers
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics, 2007
On finding the strongly connected components in a directed graph
Information Processing Letters, 1994
An O(logn) parallel connectivity algorithm
Journal of Algorithms, 1982
Finding strongly connected components in distributed graphs
Computing connected components of graphs
International Journal of Applied Mathematical Research, 2014
Foundations of Computer Science, 1984
A divide-and-conquer algorithm for identifying strongly connectedcomponents
2003
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
SIAM Journal on Computing, 1984
A new parallel algorithm for connected components in dynamic graphs
20th Annual International Conference on High Performance Computing, 2013
On Finding the Strong Components in a Directed Graph
Component Order Connectivity in Directed Graphs
Algorithmica
A simple and practical linear-work parallel algorithm for connectivity
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014
An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs
Algorithmica, 1998
Linear time algorithms for graph search and connectivity determination on complement graphs
Information Processing Letters, 1998
A linear algorithm for bipartition of biconnected graphs
Information Processing Letters, 1990
2-Edge Connectivity in Directed Graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
A Simple Algorithm for Finding All k-Edge-Connected Components
PloS one, 2015
University of Groningen Concurrent determination of connected components
2017
Information and Computation, 1991
A parallel algorithm for computing minimum spanning trees
1992
Determining 4-edge-connected components in linear time
2021
DSP-CC: I/O Efficient Parallel Computation of Connected Components in Billion-scale Networks
IEEE Transactions on Knowledge and Data Engineering, 2015
Concurrent determination of connected components
Science of Computer Programming, 2001
Efficient trimming for strongly connected components calculation
Proceedings of the 19th ACM International Conference on Computing Frontiers
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
2012
On Finding Minimal Two-Connected Subgraphs
1992
Efficient parallel algorithms for graph problems
Algorithmica, 1990
Determining uni-connectivity in directed graphs
Information Processing Letters, 1993
Formal Methods in System Design, 2016
A coarse-grained parallel algorithm for spanning tree and connected components
2004