Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs

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 result we design an O(n)-space data structure that can compute in O(log2 n) time two internally vertexdisjoint paths from s to t, for any pair of query vertices s and t. The two paths can be reported in additional O(k) time, where k is their total length.

• Type: Conference
• Year: 2010
• Where: ICALP
• Authors: Loukas Georgiadis
• Keywords: Directed Graph, ICALP 2010, N)-time Algorithm, Programming Languages, Query Vertices