{"id":"https://openalex.org/W2782223664","doi":"https://doi.org/10.1017/s0963548318000469","title":"Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs","display_name":"Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs","publication_year":2018,"publication_date":"2018-11-05","ids":{"openalex":"https://openalex.org/W2782223664","doi":"https://doi.org/10.1017/s0963548318000469","mag":"2782223664"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548318000469","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000469","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FD39F597B3D0D8FAF715AA78924BA504/S0963548318000469a.pdf/div-class-title-sparse-highly-connected-spanning-subgraphs-in-dense-directed-graphs-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FD39F597B3D0D8FAF715AA78924BA504/S0963548318000469a.pdf/div-class-title-sparse-highly-connected-spanning-subgraphs-in-dense-directed-graphs-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032372616","display_name":"Dong Yeap Kang","orcid":"https://orcid.org/0000-0003-3954-5457"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"DONG YEAP KANG","raw_affiliation_strings":["Department of Mathematical Sciences, KAIST, 291 Daehak-ro Yuseong-gu Daejeon, 34141South Korea (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, KAIST, 291 Daehak-ro Yuseong-gu Daejeon, 34141South Korea (e-mail:","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032372616"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.4275,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62681037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"28","issue":"3","first_page":"423","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/combinatorics","display_name":"Combinatorics","score":0.8876652717590332},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8556028604507446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.732634425163269},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.6906242966651917},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5913015604019165},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5669452548027039},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5367864966392517},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.498826265335083},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.44729194045066833},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.42560407519340515},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.42020735144615173},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41929009556770325},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40658217668533325}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8876652717590332},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8556028604507446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.732634425163269},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.6906242966651917},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5913015604019165},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5669452548027039},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5367864966392517},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.498826265335083},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.44729194045066833},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.42560407519340515},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.42020735144615173},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41929009556770325},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40658217668533325},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548318000469","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000469","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FD39F597B3D0D8FAF715AA78924BA504/S0963548318000469a.pdf/div-class-title-sparse-highly-connected-spanning-subgraphs-in-dense-directed-graphs-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1801.01795","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.01795","pdf_url":"https://arxiv.org/pdf/1801.01795","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":"doi:10.1017/s0963548318000469","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000469","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FD39F597B3D0D8FAF715AA78924BA504/S0963548318000469a.pdf/div-class-title-sparse-highly-connected-spanning-subgraphs-in-dense-directed-graphs-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1843805830","display_name":null,"funder_award_id":"NRF-2017R1A2B4005020","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G4771439113","display_name":null,"funder_award_id":"2017R1A","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G7232373703","display_name":null,"funder_award_id":"2017R1A2B","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G8777659018","display_name":null,"funder_award_id":"NRF-2017R1A","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G982292920","display_name":null,"funder_award_id":"NRF-20","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/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320328359","display_name":"Ministry of Science and ICT, South Korea","ror":"https://ror.org/01wpjm123"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2782223664.pdf","grobid_xml":"https://content.openalex.org/works/W2782223664.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W19898668","https://openalex.org/W433207136","https://openalex.org/W1548164611","https://openalex.org/W1996255224","https://openalex.org/W1996277976","https://openalex.org/W2011039300","https://openalex.org/W2011214451","https://openalex.org/W2017541517","https://openalex.org/W2041291748","https://openalex.org/W2052184941","https://openalex.org/W2054440703","https://openalex.org/W2083102899","https://openalex.org/W2097803233","https://openalex.org/W2133832791","https://openalex.org/W2134875769","https://openalex.org/W2157529519","https://openalex.org/W2214990641","https://openalex.org/W2300543117","https://openalex.org/W2808898944","https://openalex.org/W2963272781","https://openalex.org/W3105736412","https://openalex.org/W3106274226","https://openalex.org/W4240899876","https://openalex.org/W4246377907","https://openalex.org/W4249649555"],"related_works":["https://openalex.org/W1518627384","https://openalex.org/W3117126883","https://openalex.org/W2587669528","https://openalex.org/W2039866832","https://openalex.org/W2052184941","https://openalex.org/W2014594560","https://openalex.org/W1984251932","https://openalex.org/W1983615627","https://openalex.org/W2746332120","https://openalex.org/W1992030522"],"abstract_inverted_index":{"Mader":[0],"proved":[1],"that":[2,55,134],"every":[3,56,135],"strongly":[4,12,40,57,66,136,145,187],"k":[5,13,24,41,58,67,77,79,113,115,137,146,156,165,175,177,188],"-connected":[6,14,42,59,68,138,147],"n":[7,60,139],"-vertex":[8,61,140],"digraph":[9,34,62,105,142],"contains":[10,64,143],"a":[11,65,104,130,144],"spanning":[15,69,148],"subgraph":[16,70,149],"with":[17,71,150],"at":[18,72,151],"most":[19,73,152],"2":[20,23,25,157,166],"kn":[21,74,153],"-":[22,178],"edges,":[26,85,158],"where":[27,86],"equality":[28],"holds":[29],"for":[30,186],"the":[31,92,96,99,109,171],"complete":[32],"bipartite":[33],"DK":[35],"k,n-k":[36],".":[37,107],"For":[38],"dense":[39],"digraphs,":[43],"this":[44,132],"upper":[45],"bound":[46],"can":[47],"be":[48,168],"significantly":[49],"improved.":[50],"More":[51],"precisely,":[52],"we":[53],"prove":[54,182],"D":[63,83,89,106,119],"+":[75,80,116,154],"800":[76,112,155,164],"(":[78,82,88,114,118,176],"\u0394":[81,87,117],"))":[84,120],")":[90],"denotes":[91],"maximum":[93],"degree":[94],"of":[95,98,103],"complement":[97],"underlying":[100],"undirected":[101],"graph":[102],"Here,":[108],"additional":[110],"term":[111],"is":[121,160],"tight":[122],"up":[123],"to":[124,170],"multiplicative":[125],"and":[126],"additive":[127],"constants.":[128],"As":[129],"corollary,":[131],"implies":[133],"semicomplete":[141],"which":[159],"essentially":[161],"optimal":[162],"since":[163],"cannot":[167],"reduced":[169],"number":[172],"less":[173],"than":[174],"1)/2.":[179],"We":[180],"also":[181],"an":[183],"analogous":[184],"result":[185],"-arc-connected":[189],"directed":[190],"multigraphs.":[191],"Both":[192],"proofs":[193],"yield":[194],"polynomial-time":[195],"algorithms.":[196]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}