Finding Highly Connected Subgraphs

被引:0
|
作者
Hueffner, Falk [1 ]
Komusiewicz, Christian [1 ]
Sorge, Manuel [1 ]
机构
[1] TU Berlin, Inst Softwaretech & Theoret Informat, Berlin, Germany
来源
SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE | 2015年 / 8939卷
关键词
BOUNDS; GRAPH;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A popular way of formalizing clusters in networks are highly connected subgraphs, that is, subgraphs of k vertices that have edge connectivity larger than k/2 (equivalently, minimum degree larger than k/2). We examine the computational complexity of finding highly connected subgraphs. We first observe that this problem is NP-hard. Thus, we explore possible parameterizations, such as the solution size, number of vertices in the input, the size of a vertex cover in the input, and the number of edges outgoing from the solution (edge isolation), and expose their influence on the complexity of this problem. For some parameters, we find strong intractability results; among the parameters yielding tractability, the edge isolation seems to provide the best trade-off between running time bounds and a small parameter value in relevant instances.
引用
收藏
页码:254 / 265
页数:12
相关论文
共 50 条
  • [1] Finding connected secluded subgraphs
    Golovach, Petr A.
    Heggernes, Pinar
    Lima, Paloma T.
    Montealegre, Pedro
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 113 : 101 - 124
  • [2] Finding connected κ-subgraphs with high density
    Chen, Xujin
    Hua, Xiaodong
    Wang, Changjun
    INFORMATION AND COMPUTATION, 2017, 256 : 160 - 173
  • [3] Highly connected monochromatic subgraphs
    Bollobas, Bela
    Gyarfas, Andras
    DISCRETE MATHEMATICS, 2008, 308 (09) : 1722 - 1725
  • [4] Forcing highly connected subgraphs
    Stein, Maya Jakobine
    JOURNAL OF GRAPH THEORY, 2007, 54 (04) : 331 - 349
  • [5] ON FINDING MINIMAL 2-CONNECTED SUBGRAPHS
    KELSEN, P
    RAMACHANDRAN, V
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1995, 18 (01): : 1 - 49
  • [6] Finding Connected Dense k-Subgraphs
    Chen, Xujin
    Hu, Xiaodong
    Wang, Changjun
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 2015, 9076 : 248 - 259
  • [7] Finding densest k-connected subgraphs
    Bonchi, Francesco
    Garcia-Soriano, David
    Miyauchi, Atsushi
    Tsourakakis, Charalampos E.
    DISCRETE APPLIED MATHEMATICS, 2021, 305 : 34 - 47
  • [8] Finding Dense and Connected Subgraphs in Dual Networks
    Wu, Yubao
    Jin, Ruoming
    Zhu, Xiaofeng
    Zhang, Xiang
    2015 IEEE 31ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2015, : 915 - 926
  • [9] Parameterized complexity of finding connected induced subgraphs
    Cai, Leizhen
    Ye, Junjie
    THEORETICAL COMPUTER SCIENCE, 2015, 607 : 49 - 59
  • [10] Partitioning a Graph into Highly Connected Subgraphs
    Borozan, Valentin
    Ferrara, Michael
    Fujita, Shinya
    Furuya, Michitaka
    Manoussakis, Yannis
    Narayanan, N.
    Stolee, Derrick
    JOURNAL OF GRAPH THEORY, 2016, 82 (03) : 322 - 333