2 search results - page 1 / 1 » Testing 2-Vertex Connectivity and Computing Pairs of Vertex-... |
70
Voted
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
APPROX
2004
Springer
15 years 2 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...