SPARSE SPANNING κ-CONNECTED SUBGRAPHS IN TOURNAMENTS

被引：3

作者：

Kang, Dong Yeap ^{[1
]}

Kim, Jaehoon ^{[2
]}

Kim, Younjin ^{[3
]}

Suh, Geewon ^{[4
]}

机构：

[1] Korea Adv Inst Sci & Technol, Dept Math Sci, 291 Daehak Ro, Daejeon 305701, South Korea

[2] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands, England

[3] Ewha Womans Univ, Inst Math Sci, Seoul, South Korea

[4] Korea Adv Inst Sci & Technol, Sch Elect Engn, 291 Daehak Ro, Daejeon 305701, South Korea

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2017年 / 31卷 / 03期

基金：

新加坡国家研究基金会; 欧洲研究理事会;

关键词：

tournament; connectivity; subgraph; MINIMUM DEGREE; DIGRAPHS; CYCLES; SUBDIGRAPHS; ALGORITHM; ARCS;

D O I：

10.1137/16M1064805

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In 2009, Bang-Jensen asked whether there exists a function g(kappa) such that every strongly kappa-connected n-vertex tournament contains a strongly kappa-connected spanning subgraph with at most kappa n broken vertical bar g(k) arcs. In this paper, we answer the question by showing that every strongly kappa-connected n-vertex tournament contains a strongly kappa-connected spanning subgraph with at most kappa n+750k(2) log(2)(kappa+1) arcs, and there is a polynomial-time algorithm to find the spanning subgraph.

引用

页码：2206 / 2227

页数：22

共 50 条

[41] INTERPOLATION THEOREM FOR THE NUMBER OF PENDANT VERTICES OF CONNECTED SPANNING SUBGRAPHS OF EQUAL SIZE
BAREFOOT, CA
DISCRETE MATHEMATICS, 1984, 49 (02) : 109 - 112
[42] On the existence of k edge-disjoint 2-connected spanning subgraphs
Jordán, T
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (02) : 257 - 262
[43] SOME UNAVOIDABLE SUBGRAPHS OF STRONG TOURNAMENTS
PETROVIC, V
COMBINATORICS /, 1988, 52 : 423 - 426
[44] A bad example for the iterative rounding method for mincost k-connected spanning subgraphs
Aazami, Ashkan
Cheriyan, Joseph
Laekhanukit, Bundit
DISCRETE OPTIMIZATION, 2013, 10 (01) : 25 - 41
[45] An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs
Cheriyan, J
Sebö, A
Szigeti, Z
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 126 - 136
[46] Packing of rigid spanning subgraphs and spanning trees
Cheriyan, Joseph
de Gevigney, Olivier Durand
Szigeti, Zoltan
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2014, 105 : 17 - 25
[47] Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs
Berger, A
Czumaj, A
Grigni, M
Zhao, HR
ALGORITHMS - ESA 2005, 2005, 3669 : 472 - 483
[48] Approximating minimum-size k-connected spanning subgraphs via matching
Cheriyan, J
Thurimella, R
37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 292 - 301
[49] 2-Connected spanning subgraphs with low maximum degree in locally planar graphs
Ellingham, M. N.
Kawarabayashi, Ken-ichi
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (03) : 401 - 412
[50] Approximating minimum-size k-connected spanning subgraphs via matching
Cheriyan, J
Thurimella, R
SIAM JOURNAL ON COMPUTING, 2000, 30 (02) : 528 - 560

← 1 2 3 4 5 →