Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
verfasst von : Loukas Georgiadis
Erschienen in: Automata, Languages and Programming
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
(log
2
n
) time two internally vertex-disjoint paths from
s
to
t
, for any pair of query vertices
s
and
t
of a 2-vertex connected directed graph. The two paths can be reported in additional
O
(
k
) time, where
k
is their total length.