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 条

[31] Can We Locally Compute Sparse Connected Subgraphs?
Rubinfeld, Ronitt
COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017), 2017, 10304 : 38 - 47
[32] Color-avoiding connected spanning subgraphs with minimum number of edges
Pinter, Jozsef
Varga, Kitti
DISCRETE APPLIED MATHEMATICS, 2024, 349 : 25 - 43
[33] Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
Dory, Michal
PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 149 - 158
[34] Local Construction of Connected and Plane Spanning Subgraphs under Acyclic Redundancy
Boehmer, Steffen
Boeltz, Lucas
Frey, Hannes
2020 18TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT), 2020,
[35] On the spanning connectivity of tournaments
Zhang, Bo
Yang, Weihua
Zhang, Shurong
DISCRETE APPLIED MATHEMATICS, 2018, 239 : 218 - 222
[36] Sparse spanning subgraphs preserving connectivity and distance between vertices and vertex subsets
Miwa, H
Ito, H
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1998, E81A (05) : 832 - 841
[37] Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network
Liang, Jing
Zhao, Haixing
Yin, Jun
Xie, Sun
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 590
[38] A note on enumeration of 3-edge-connected spanning subgraphs in plane graphs
Matsui, Yasuko
Ozeki, Kenta
Matsui, Yasuko (yasuko@tokai-u.jp), 1600, Institute of Electronics, Information and Communication, Engineers, IEICE (E104D): : 389 - 391
[39] Minimum weight 2-edge-connected spanning subgraphs in planar graphs
Berger, Andre
Grigni, Michelangelo
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 90 - +
[40] A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs
Matsui, Yasuko
Ozeki, Kenta
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2021, E104D (03): : 389 - 391

← 1 2 3 4 5 →