{"id":"https://openalex.org/W2021924280","doi":"https://doi.org/10.1016/0166-218x(95)00105-z","title":"On strongly connected digraphs with bounded cycle length","display_name":"On strongly connected digraphs with bounded cycle length","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2021924280","doi":"https://doi.org/10.1016/0166-218x(95)00105-z","mag":"2021924280"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(95)00105-z","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0166-218x(95)00105-z","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/0166-218x(95)00105-z","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Samir Khuller","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Box 830688, Richardson, TX 75083, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Box 830688, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":null,"display_name":"Neal Young","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Neal Young","raw_affiliation_strings":["Department of Computer Science, Dartmouth College, Hanover, NH 03755, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, Hanover, NH 03755, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":{"value":2750,"currency":"USD","value_usd":2750},"fwci":0.0,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.15219355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"69","issue":"3","first_page":"281","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7996000051498413,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7996000051498413,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.14010000228881836,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.021299999207258224,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.6722999811172485},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6129999756813049},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5127999782562256},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4943999946117401},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4681999981403351},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4580000042915344},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4535999894142151},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.3776000142097473}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8844000101089478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7677000164985657},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6722999811172485},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6129999756813049},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5141000151634216},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5127999782562256},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4943999946117401},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4681999981403351},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4580000042915344},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4535999894142151},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.3776000142097473},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.35580000281333923},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.3156999945640564},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.2815000116825104},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.2694000005722046},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.2597000002861023},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.2590999901294708},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.2515000104904175}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0166-218x(95)00105-z","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0166-218x(95)00105-z","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0205011","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0205011","pdf_url":"https://arxiv.org/pdf/cs/0205011","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.1016/0166-218x(95)00105-z","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0166-218x(95)00105-z","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1981358946","https://openalex.org/W2064796716","https://openalex.org/W2076447414","https://openalex.org/W2110920860","https://openalex.org/W2157529519","https://openalex.org/W2952664587","https://openalex.org/W6655561421"],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,8,14,34,45,80],"directed":[2,62],"graph":[3],"G":[4],"=":[5],"(V,":[6],"E),":[7],"natural":[9],"problem":[10,70],"is":[11,33,44,71],"to":[12,38,49,73,79],"choose":[13],"minimum":[15],"number":[16],"of":[17,87],"the":[18,52,84,88,94],"edges":[19],"in":[20,40,58,83],"E":[21],"such":[22],"that,":[23],"for":[24,93],"any":[25],"two":[26],"vertices":[27],"u":[28,37,48],"and":[29],"v,":[30],"if":[31],"there":[32,43],"path":[35,46],"from":[36,47],"v":[39,50],"E,":[41],"then":[42],"among":[51],"chosen":[53],"edges.":[54],"We":[55],"show":[56],"that":[57],"graphs":[59],"having":[60],"no":[61],"cycle":[63],"with":[64],"more":[65],"than":[66],"three":[67],"edges,":[68],"this":[69],"equivalent":[72],"Maximum":[74],"Bipartite":[75],"Matching.":[76],"This":[77],"leads":[78],"small":[81],"improvement":[82],"performance":[85],"guarantee":[86],"previous":[89],"best":[90],"approximation":[91],"algorithm":[92],"general":[95],"problem.":[96]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-06-24T00:00:00"}