View : 45 Download: 4

SPARSE SPANNING kappa-CONNECTED SUBGRAPHS IN TOURNAMENTS

Title
SPARSE SPANNING kappa-CONNECTED SUBGRAPHS IN TOURNAMENTS
Authors
Kang, Dong YeapKim, JaehoonKim, YounjinSuh, Geewon
Ewha Authors
김연진
Issue Date
2017
Journal Title
SIAM JOURNAL ON DISCRETE MATHEMATICS
ISSN
0895-4801JCR Link1095-7146JCR Link
Citation
vol. 31, no. 3, pp. 2206 - 2227
Keywords
tournamentconnectivitysubgraph
Publisher
SIAM PUBLICATIONS
Indexed
SCI; SCIE; SCOPUS WOS
Abstract
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.
DOI
10.1137/16M1064805
Appears in Collections:
연구기관 > 수리과학연구소 > Journal papers
Files in This Item:
Sparse spanning.pdf(277.57 kB)Download
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE