Finding 2-edge and 2-vertex strongly connected components in quadratic time

被引：0
|
作者：
20155101705918
机构：
来源：
(1) University of Vienna, Vienna, Austria | 1600年 / ERATO Kawarabayashi Large Graph Project; MEXT Grant-in-Aid for Scientific Research on Innovative Areas: Exploring the Limits of Computation; Research Institute for Mathematical Sciences; Tateisi Science and Technology Foundation卷 / Springer Verlag期
关键词：
We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time; in directed graphs with m edges and n vertices only rather simple O(mn)-time algorithms were known. We use a hierarchical sparsification technique to obtain algorithms that run in time O(n2). For 2-edge strongly connected components our algorithm gives the first running time improvement in 20 years. Additionally we present an O(m2/ log n)-time algorithm for 2-edge strongly connected components; and thus improve over the O(mn) running time also when m = O(n). Our approach extends to k-edge and k-vertex strongly connected components for any constant k with a running time of O(n2 log n) for k-edge-connectivity and O(n3) for k-vertex-connectivity. © Springer-Verlag Berlin Heidelberg 2015;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
158169
引用
收藏
相关论文
共 50 条
  • [21] Convex partitions with 2-edge connected dual graphs
    Al-Jubeh, Marwan
    Hoffmann, Michael
    Ishaque, Mashhood
    Souvaine, Diane L.
    Toth, Csaba D.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (03) : 409 - 425
  • [22] Dynamic bottleneck optimization for k-edge and 2-vertex connectivity
    Telelis, Orestis A.
    Zissimopoulos, Vassilis
    INFORMATION PROCESSING LETTERS, 2008, 106 (06) : 251 - 257
  • [23] Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Karanasiou, Aikaterini
    THEORETICAL COMPUTER SCIENCE, 2020, 807 : 185 - 200
  • [24] 2-Vertex Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Laura, Luigi
    Parotsidis, Nikos
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 605 - 616
  • [25] Finding strongly connected components in parallel
    Pogorilyy, S. D.
    Lozytskyi, S., I
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2007, 6 (02) : 236 - 245
  • [26] 2-Vertex Self Switching of Trees
    Jayasekaran, C.
    Sudha, J. Christabel
    Shijo, M. Ashwin
    COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2022, 13 (03): : 1037 - 1046
  • [27] Minimum 2-edge connected spanning subgraph of certain graphs
    Roy, S.
    William, Albert
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 92 : 255 - 264
  • [28] MapReduce for Graphs Processing: New Big Data Algorithm for 2-Edge Connected Components and Future Ideas
    Dahiphale, Devendra
    IEEE ACCESS, 2023, 11 : 54986 - 55001
  • [29] Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
    Bessy, Stephane
    Dross, Francois
    Knor, Martin
    Skrekovski, Riste
    DISCRETE APPLIED MATHEMATICS, 2020, 284 : 195 - 200
  • [30] Dynamics for a 2-vertex quantum gravity model
    Borja, Enrique F.
    Diaz-Polo, Jacobo
    Garay, Inaki
    Livine, Etera R.
    CLASSICAL AND QUANTUM GRAVITY, 2010, 27 (23)
12345