
Determining 4edgeconnected components in linear time
In this work, we present the first linear time deterministic algorithm c...
read it

Improved LinearTime Algorithm for Computing the 4EdgeConnected Components of a Graph
We present an improved algorithm for computing the 4edgeconnected comp...
read it

LinearTime Algorithms for Computing Twinless Strong Articulation Points and Related Problems
A directed graph G=(V,E) is twinless strongly connected if it contains a...
read it

A Nearoptimal Algorithm for Edge Connectivitybased Hierarchical Graph Decomposition
Driven by many applications in graph analytics, the problem of computing...
read it

A universal predictorcorrector type incremental algorithm for the construction of weighted straight skeletons based on the notion of deforming polygon
A new predictorcorrector type incremental algorithm is proposed for the...
read it

Extremality and Sharp Bounds for the kedgeconnectivity of Graphs
Boesch and Chen (SIAM J. Appl. Math., 1978) introduced the cutversion o...
read it

FastSV: A DistributedMemory Connected Component Algorithm with Fast Convergence
This paper presents a new distributedmemory algorithm called FastSV for...
read it
A simple certifying algorithm for 3edgeconnectivity
A lineartime certifying algorithm for 3edgeconnectivity is presented. Given an undirected graph G, if G is 3edgeconnected, the algorithm generates a construction sequence as a positive certificate for G. Otherwise, the algorithm decomposes G into its 3edgeconnected components and at the same time generates a construction sequence for each connected component as well as the bridges and a cactus representation of the cutpairs in G. All of these are done by making only one pass over G using an innovative graph contraction technique. Moreover, the graph need not be 2edgeconnected.
READ FULL TEXT
Comments
There are no comments yet.