Generating minimal spanning k-vertex connected subgraphs

被引：0
|
作者：
Boros, Endre [1 ]
Borys, Konrad [1 ]
Elbassioni, Khaled [2 ]
Gurvich, Vladimir [1 ]
Makino, Kazuhisa [3 ]
Rudolf, Gabor [1 ]
机构：
[1] Rutgers State Univ, RUTCOR, 640 Barthholomew Rd, Piscataway, NJ 08854 USA
[2] Max Planck Inst Informat, Saarbrucken, Germany
[3] Osaka Univ, Div Math Sci Social Syst, Grad Sch Engn Sci, Osaka 5608531, Japan
来源：
COMPUTING AND COMBINATORICS, PROCEEDINGS | 2007年 / 4598卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that minimal k-vertex connected spanning sub-graphs of a given graph can be generated in incremental polynomial time for any fixed k.
引用
收藏
页码：222 / +
页数：2
相关论文
共 50 条
  • [1] Generating 3-vertex connected spanning subgraphs
    Boros, Endre
    Borys, Konrad
    Gurvich, Vladimir
    Rudolf, Gabor
    [J]. DISCRETE MATHEMATICS, 2008, 308 (24) : 6285 - 6297
  • [2] Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k = 3, 4, 5
    Dinitz, Y
    Nutov, Z
    [J]. ALGORITHMS AND COMPLEXITY, 1997, 1203 : 13 - 24
  • [3] Reconstruction from the deck of k-vertex induced subgraphs
    Spinoza, Hannah
    West, Douglas B.
    [J]. JOURNAL OF GRAPH THEORY, 2019, 90 (04) : 497 - 522
  • [4] AN O(log2 k)-APPROXIMATION ALGORITHM FOR THE k-VERTEX CONNECTED SPANNING SUBGRAPH PROBLEM
    Fakcharoenphol, Jittat
    Laekhanukit, Bundit
    [J]. SIAM JOURNAL ON COMPUTING, 2012, 41 (05) : 1095 - 1109
  • [5] An O(log2 k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem
    Fakcharoenphol, Jittat
    Laekhanukit, Bundit
    [J]. STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 153 - 158
  • [6] Graphs with complete minimal k-vertex separators
    McKee, Terry A.
    [J]. ARS COMBINATORIA, 2012, 103 : 225 - 232
  • [7] Enumerating k-Vertex Connected Components in Large Graphs
    Wen, Dong
    Qin, Lu
    Zhang, Ying
    Chang, Lijun
    Chen, Ling
    [J]. 2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, : 52 - 63
  • [8] SPANNING SUBGRAPHS OF K-CONNECTED DIGRAPHS
    MARCUS, DA
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 30 (01) : 21 - 31
  • [9] Towards k-vertex connected component discovery from large networks
    Yuan Li
    Guoren Wang
    Yuhai Zhao
    Feida Zhu
    Yubao Wu
    [J]. World Wide Web, 2020, 23 : 799 - 830
  • [10] ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS
    Elmasry, Amr
    Tsin, Yung H.
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (03) : 355 - 368
12345