Incremental Strong Connectivity and 2-Connectivity in Directed Graphs

Abstract : In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of those cuts. We give a conditional lower bound that provides evidence that our algorithms may be tight up to a sub-polynomial factors. As an additional result, with our approach we can also maintain dynamically the 2-vertex-connected components of a digraph during any sequence of edge insertions in a total of O(mn) time. This matches the bounds for the incremental maintenance of the 2-edge-connected components of a digraph.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-01925953
Contributor : Marie-France Sagot <>
Submitted on : Sunday, November 18, 2018 - 4:20:43 PM
Last modification on : Tuesday, November 20, 2018 - 1:17:53 AM
Document(s) archivé(s) le : Tuesday, February 19, 2019 - 12:48:26 PM

File

1802.10189.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01925953, version 1
  • ARXIV : 1802.10189

Collections

Citation

Loukas Georgiadis, Giuseppe Italiano, Nikos Parotsidis. Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. Latin American Symposium on Theoretical Informatics, 2018, Buenos Aires, Argentina. 〈hal-01925953〉

Share

Metrics

Record views

9

Files downloads

16