NL repository
menu
검색
Library
Browse
Communities & Collections
By Date
Authors
Titles
Subject
My Repository
My Account
Receive email updates
Edit Profile
DSpace at EWHA
연구기관
수리과학연구소
Journal papers
View : 807 Download: 0
Sparse spanning κ-connected subgraphs in tournaments
Title
Sparse spanning κ-connected subgraphs in tournaments
Authors
Kang D.Y.
;
Kim J.
;
Kim Y.
;
Suh G.
Ewha Authors
김연진
SCOPUS Author ID
김연진
Issue Date
2017
Journal Title
SIAM Journal on Discrete Mathematics
ISSN
0895-4801
Citation
SIAM Journal on Discrete Mathematics vol. 31, no. 3, pp. 2206 - 2227
Keywords
Connectivity
;
Subgraph
;
Tournament
Publisher
Society for Industrial and Applied Mathematics Publications
Indexed
SCIE; SCOPUS
Document Type
Article
Abstract
In 2009, Bang-Jensen asked whether there exists a function g(κ) such that every strongly κ-connected n-vertex tournament contains a strongly κ-connected spanning subgraph with at most κn + g(κ) arcs. In this paper, we answer the question by showing that every strongly kconnected n-vertex tournament contains a strongly κ-connected spanning subgraph with at most κn+750κ2 log2(κ+1) arcs, and there is a polynomial-time algorithm to find the spanning subgraph. © 2017 Society for Industrial and Applied Mathematics.
DOI
10.1137/16M1064805
Appears in Collections:
연구기관
>
수리과학연구소
>
Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML
Show full item record
Find@EWHA
트윗하기
BROWSE
Communities & Collections
By Date
Authors
Titles
Subject