{"id":"https://openalex.org/W2300543117","doi":"https://doi.org/10.1137/16m1064805","title":"Sparse Spanning $k$-Connected Subgraphs in Tournaments","display_name":"Sparse Spanning $k$-Connected Subgraphs in Tournaments","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2300543117","doi":"https://doi.org/10.1137/16m1064805","mag":"2300543117"},"language":"en","primary_location":{"id":"doi:10.1137/16m1064805","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1064805","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1603.02474","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dong Yeap Kang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dong Yeap Kang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Jaehoon Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jaehoon Kim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Younjin Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Younjin Kim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Geewon Suh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Geewon Suh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4582,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62669542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"3","first_page":"2206","last_page":"2227"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6904000043869019,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6904000043869019,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.13809999823570251,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.121799997985363,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.9126999974250793},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6328999996185303},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4650999903678894},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.45170000195503235},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42660000920295715},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.319599986076355}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.9126999974250793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8420000076293945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7760000228881836},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6328999996185303},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4878000020980835},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4650999903678894},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.45170000195503235},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42660000920295715},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.30820000171661377},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30090001225471497},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.28060001134872437},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.26980000734329224},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26269999146461487}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/16m1064805","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1064805","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1603.02474","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.02474","pdf_url":"https://arxiv.org/pdf/1603.02474","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1603.02474","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.02474","pdf_url":"https://arxiv.org/pdf/1603.02474","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2794360581","display_name":null,"funder_award_id":"306349","funder_id":"https://openalex.org/F4320333065","funder_display_name":"Seventh Framework Programme"},{"id":"https://openalex.org/G3253209512","display_name":null,"funder_award_id":"2011-0011653","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G63620102","display_name":null,"funder_award_id":"2009-0093827","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320315859","display_name":"POSCO TJ Park Foundation","ror":"https://ror.org/0375ste74"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320333065","display_name":"Seventh Framework Programme","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W433207136","https://openalex.org/W2011214451","https://openalex.org/W2017541517","https://openalex.org/W2050734073","https://openalex.org/W2068346351","https://openalex.org/W2079854871","https://openalex.org/W2097803233","https://openalex.org/W2120092792","https://openalex.org/W2133832791","https://openalex.org/W2214990641","https://openalex.org/W2963272781","https://openalex.org/W2986504093","https://openalex.org/W4249649555"],"related_works":[],"abstract_inverted_index":{"In":[0,30],"2009,":[1],"Bang-Jensen":[2],"asked":[3],"whether":[4],"there":[5,59],"exists":[6],"a":[7,18,46,61],"function":[8],"$g(k)$":[9],"such":[10],"that":[11,39],"every":[12,40],"strongly":[13,19,41,47],"$k$-connected":[14,20,42,48],"$n$-vertex":[15,43],"tournament":[16,44],"contains":[17,45],"spanning":[21,49,67],"subgraph":[22,50],"with":[23,51],"at":[24,52],"most":[25,53],"$kn":[26,54],"+":[27,55],"g(k)$":[28],"arcs.":[29],"this":[31],"paper,":[32],"we":[33],"answer":[34],"the":[35,66],"question":[36],"by":[37],"showing":[38],"750k^2\\log_2(k+1)$":[56],"arcs,":[57],"and":[58],"is":[60],"polynomial-time":[62],"algorithm":[63],"to":[64],"find":[65],"subgraph.":[68]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2016-06-24T00:00:00"}