Sparse certificates for 2-connectivity in directed graphs

Georgiadis, Loukas; Italiano, Giuseppe F.; Karanasiou, Aikaterini; Papadopoulos, Charis; Parotsidis, Nikos

doi:10.1016/j.tcs.2017.06.015

Cited by 2 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also remark that the sparse certificates of [19] and [20] maintain, respectively, only the 2-edge and the 2-vertex-connected components. Such sparse certificates, including our new construction, can be used to obtain fast approximation algorithms for computing sparse 2-connectivity preserving subgraphs [17,28]. Our new sparse certificate also provides an alternative way to achieve the bounds stated in Theorems 3.8 and 6.9.…”

Section: Computing 2-vertex-connected Componentsmentioning

confidence: 98%

Strong Connectivity in Directed Graphs under Failures, with Applications

Georgiadis¹,

Italiano²,

Parotsidis³

2020

SIAM J. Comput.

Self Cite

View full text Add to dashboard Cite

In this paper, we investigate some basic connectivity problems in directed graphs (digraphs). Let G be a digraph with m edges and n vertices, and let G \ e (resp., G \ v) be the digraph obtained after deleting edge e (resp., vertex v) from G. As a first result, we show how to compute in O(m + n) worst-case time: • The total number of strongly connected components in G \ e (resp., G \ v), for all edges e (resp., for all vertices v) in G. • The size of the largest and of the smallest strongly connected components in G \ e (resp., G \ v), for all edges e (resp., for all vertices v) in G. Let G be strongly connected. We say that edge e (resp., vertex v) separates two vertices x and y, if x and y are no longer strongly connected in G \ e (resp., G \ v). As a second set of results, we show how to build in O(m + n) time O(n)-space data structures that can answer in optimal time the following basic connectivity queries on digraphs: • Report in O(n) worst-case time all the strongly connected components of G \ e (resp., G \ v), for a query edge e (resp., vertex v). • Test whether an edge or a vertex separates two query vertices in O(1) worst-case time. • Report all edges (resp., vertices) that separate two query vertices in optimal worst-case time, i.e., in time O(k), where k is the number of separating edges (resp., separating vertices). (For k = 0, the time is O(1)). All our bounds are tight and are obtained with a common algorithmic framework, based on a novel compact representation of the decompositions induced by the 1-connectivity (i.e., 1-edge and 1-vertex) cuts in digraphs, which might be of independent interest. With the help of our data structures we can design efficient algorithms for several other connectivity problems on digraphs and we can also obtain in linear time a strongly connected spanning subgraph of G with O(n) edges that maintains the 1-connectivity cuts of G and the decompositions induced by those cuts.

show abstract

Section: Computing 2-vertex-connected Componentsmentioning

confidence: 98%

Strong Connectivity in Directed Graphs under Failures, with Applications

Georgiadis¹,

Italiano²,

Parotsidis³

2020

SIAM J. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

Strong Connectivity in Directed Graphs under Failures, with Applications

Georgiadis¹,

Italiano²,

Parotsidis³

2017

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms

Self Cite

View full text Add to dashboard Cite

Let G be a directed graph (digraph) with m edges and n vertices, and let G \ e (resp., G \ v) be the digraph obtained after deleting edge e (resp., vertex v) from G. We show how to compute in O(m + n) worst-case time:• The total number of strongly connected components in G \ e (resp., G \ v), for all edges e (resp., for all vertices v) in G.• The size of the largest and of the smallest strongly connected components in G \ e (resp., G \ v), for all edges e (resp., for all vertices v) in G. Let G be strongly connected. We say that edge e (resp., vertex v) separates two vertices x and y, if x and y are no longer strongly connected in G \ e (resp., G \ v). We also show how to build in O(m+n) time O(n)-space data structures that can answer in optimal time the following basic connectivity queries on digraphs:• Report in O(n) worst-case time all the strongly connected components of G \ e (resp., G \ v), for a query edge e (resp., vertex v).• Test whether an edge or a vertex separates two query vertices in O(1) worst-case time.• Report all edges (resp., vertices) that separate two query vertices in optimal worst-case time, i.e., in time O(k), where k is the number of separating edges (resp., separating vertices). (For k = 0, the time is O(1)). All our bounds are tight and are obtained with a common algorithmic framework, based on a novel compact representation of the decompositions induced by 1-edge and 1-vertex cuts in digraphs, which might be of independent interest. With the help of our data structures we can design efficient algorithms for several other connectivity problems on digraphs and we can also obtain in linear time a strongly connected spanning subgraph of G with O(n) edges that maintains the 1-connectivity cuts of G and the decompositions induced by those cuts.

show abstract

Sparse certificates for 2-connectivity in directed graphs

Cited by 2 publications

References 29 publications

Strong Connectivity in Directed Graphs under Failures, with Applications

Strong Connectivity in Directed Graphs under Failures, with Applications

Strong Connectivity in Directed Graphs under Failures, with Applications

Contact Info

Product

Resources

About