Add to ORKGA parallel algorithm for finding 3-edge-connected components of an undirected graph on a CRCW PRAM is presented. The time and work complexity of this algorithm is O(logn) and O((m+n)loglogn), respectively, where n is the number of vertices and m is the number of edges in the input graph. The algorithm is based on ear decomposition and reduction of 3-edge-connectivity to 1-vertex-connectivity. This is the first 3-edge-connected component algorithm of a parallel model
In this work, we present the first linear time deterministic algorithm computing the 4-edge-connecte...
We present a certifying algorithm that tests graphs for 3-edge-connectivity; the algorithm works in ...
AbstractFew existing parallel graph algorithms achieve optimality when applied to very sparse graphs...
A parallel algorithm for finding 3-edge-connected components of an undirected graph on a CRCW PRAM i...
There are quite a number of linear algorithms to compute 3-edge connected components of a multi-grap...
AbstractFinding the connected components of an undirected graphG=(V, E) onn=|V| vertices andm=|E| ed...
Finding connected components is one of the most widely used operations on a graph. Optimal serial al...
We present fast and ecient parallel algorithms for nding the connected components of an undirected g...
Finding the connected components of a graph is a basic computational problem. In recent years, there...
AbstractAn optimal algorithm for 3-edge-connectivity is presented. The algorithm performs only one p...
Abstract. In this paper we consider the problem of computing the connected components of the complem...
The design is described of a parallel version of Tarjan's algorithm for the determination of equival...
International audienceThe notions of edge-cuts and k-edge-connected components are fundamental in gr...
We present a new CREW PRAM algorithm for finding connected components. For a graph G with n vertice...
The study of graph algorithms is an important area of research in computer science, since graphs off...
In this work, we present the first linear time deterministic algorithm computing the 4-edge-connecte...
We present a certifying algorithm that tests graphs for 3-edge-connectivity; the algorithm works in ...
AbstractFew existing parallel graph algorithms achieve optimality when applied to very sparse graphs...
A parallel algorithm for finding 3-edge-connected components of an undirected graph on a CRCW PRAM i...
There are quite a number of linear algorithms to compute 3-edge connected components of a multi-grap...
AbstractFinding the connected components of an undirected graphG=(V, E) onn=|V| vertices andm=|E| ed...
Finding connected components is one of the most widely used operations on a graph. Optimal serial al...
We present fast and ecient parallel algorithms for nding the connected components of an undirected g...
Finding the connected components of a graph is a basic computational problem. In recent years, there...
AbstractAn optimal algorithm for 3-edge-connectivity is presented. The algorithm performs only one p...
Abstract. In this paper we consider the problem of computing the connected components of the complem...
The design is described of a parallel version of Tarjan's algorithm for the determination of equival...
International audienceThe notions of edge-cuts and k-edge-connected components are fundamental in gr...
We present a new CREW PRAM algorithm for finding connected components. For a graph G with n vertice...
The study of graph algorithms is an important area of research in computer science, since graphs off...
In this work, we present the first linear time deterministic algorithm computing the 4-edge-connecte...
We present a certifying algorithm that tests graphs for 3-edge-connectivity; the algorithm works in ...
AbstractFew existing parallel graph algorithms achieve optimality when applied to very sparse graphs...