Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k

被引：0
|
作者：
University of Michigan, United States [1 ]
不详 [2 ]
机构：
来源：
arXiv | 1600年
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Undirected graphs
引用
收藏
相关论文
共 50 条
  • [21] MINIMUM AUGMENTATION OF A TREE TO A K-EDGE-CONNECTED GRAPH
    UENO, S
    KAJITANI, Y
    WADA, H
    NETWORKS, 1988, 18 (01) : 19 - 25
  • [22] THE NUMBER OF VERTICES OF DEGREE-K IN A MINIMALLY K-EDGE-CONNECTED GRAPH
    CAI, MC
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 58 (02) : 225 - 239
  • [23] A new algorithm to determine minimally k-edge-connected graphs with odd k
    Ye, Yunming
    Li, Yueping
    APPLIED MATHEMATICS & INFORMATION SCIENCES, 2013, 7 (03): : 983 - 989
  • [24] On the Minimum Number of Spanning Trees in k-Edge-Connected Graphs
    Ok, S.
    Thomassen, C.
    JOURNAL OF GRAPH THEORY, 2017, 84 (03) : 286 - 296
  • [25] On shortest k-edge-connected Steiner networks in metric spaces
    Du, XF
    Hu, XD
    Jia, XH
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000, 4 (01) : 99 - 107
  • [26] On Shortest k-Edge-Connected Steiner Networks in Metric Spaces
    Xiufeng Du
    Xiaodong Hu
    Xiaohua Jia
    Journal of Combinatorial Optimization, 2000, 4 : 99 - 107
  • [27] Extremal problems on saturation for the family of k-edge-connected graphs
    Lei, Hui
    Suil, O.
    Shi, Yongtang
    West, Douglas B.
    Zhu, Xuding
    DISCRETE APPLIED MATHEMATICS, 2019, 260 : 278 - 283
  • [28] A Simple Algorithm for Finding All k-Edge-Connected Components
    Wang, Tianhao
    Zhang, Yong
    Chin, Francis Y. L.
    Ting, Hing-Fung
    Tsin, Yung H.
    Poon, Sheung-Hung
    PLOS ONE, 2015, 10 (09):
  • [29] THE MINIMUM AUGMENTATION OF ANY GRAPH TO A K-EDGE-CONNECTED GRAPH
    CAI, GR
    SUN, YG
    NETWORKS, 1989, 19 (01) : 151 - 172
  • [30] THE AUGMENTATION OF UNDIRECTED WEIGHTED GRAPH TO A K-EDGE-CONNECTED GRAPH
    孙立山
    孙雨耕
    杨山
    JournalofElectronics(China), 1992, (03) : 218 - 224
12345