{"id":"https://openalex.org/W3208882121","doi":"https://doi.org/10.1145/3519935.3520030","title":"The shortest even cycle problem is tractable","display_name":"The shortest even cycle problem is tractable","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W3208882121","doi":"https://doi.org/10.1145/3519935.3520030","mag":"3208882121"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520030","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520030","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520030","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520030","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038787166","display_name":"Andreas Bj\u00f6rklund","orcid":"https://orcid.org/0009-0009-9303-9986"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Andreas Bj\u00f6rklund","raw_affiliation_strings":["Lund University, Sweden"],"affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041727204","display_name":"Thore Husfeldt","orcid":"https://orcid.org/0000-0001-9078-4512"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["DK","SE"],"is_corresponding":false,"raw_author_name":"Thore Husfeldt","raw_affiliation_strings":["Lund University, Sweden / IT University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Lund University, Sweden / IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386","https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055721632","display_name":"Petteri Kaski","orcid":"https://orcid.org/0009-0002-3069-7753"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Petteri Kaski","raw_affiliation_strings":["Aalto University, Finland"],"affiliations":[{"raw_affiliation_string":"Aalto University, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038787166"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":null,"apc_paid":null,"fwci":0.3017,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55979486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"117","last_page":"130"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.6298646330833435},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5995696187019348},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5051010251045227},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4573580026626587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4531734585762024},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.45193469524383545},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4416516125202179},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4395481050014496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4364679455757141},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42837607860565186},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.12066122889518738},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11232858896255493}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6298646330833435},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5995696187019348},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5051010251045227},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4573580026626587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4531734585762024},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.45193469524383545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4416516125202179},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4395481050014496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4364679455757141},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42837607860565186},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.12066122889518738},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11232858896255493},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3519935.3520030","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520030","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520030","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/117288","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/d66d23c1-e581-40d9-a3c5-4c7b0a18c9bf","pdf_url":"https://research.aalto.fi/files/89252922/The_Shortest_Even_Cycle_Problem_Is_Tractable.pdf","source":{"id":"https://openalex.org/S4306401663","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:lup.lub.lu.se:f541e400-a51f-4ae7-832d-b08be85dd4eb","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/f541e400-a51f-4ae7-832d-b08be85dd4eb","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0737-8017","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3519935.3520030","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520030","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520030","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3208882121.pdf","grobid_xml":"https://content.openalex.org/works/W3208882121.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W146202307","https://openalex.org/W1471103927","https://openalex.org/W1562183207","https://openalex.org/W1575411448","https://openalex.org/W1584631835","https://openalex.org/W1586904125","https://openalex.org/W1599026900","https://openalex.org/W1796413553","https://openalex.org/W1852383912","https://openalex.org/W1966874927","https://openalex.org/W1968245619","https://openalex.org/W1968569343","https://openalex.org/W1973041905","https://openalex.org/W1978655847","https://openalex.org/W1991858502","https://openalex.org/W2002326865","https://openalex.org/W2002621924","https://openalex.org/W2005354172","https://openalex.org/W2006912660","https://openalex.org/W2038643780","https://openalex.org/W2045037860","https://openalex.org/W2056228264","https://openalex.org/W2061586553","https://openalex.org/W2064153357","https://openalex.org/W2066904980","https://openalex.org/W2067069954","https://openalex.org/W2080132708","https://openalex.org/W2080423878","https://openalex.org/W2082001376","https://openalex.org/W2082002555","https://openalex.org/W2082180697","https://openalex.org/W2090129250","https://openalex.org/W2096113666","https://openalex.org/W2131028233","https://openalex.org/W2131676402","https://openalex.org/W2137541800","https://openalex.org/W2148009509","https://openalex.org/W2216833188","https://openalex.org/W2296148711","https://openalex.org/W2596605817","https://openalex.org/W2613956024","https://openalex.org/W2912335270","https://openalex.org/W2963733895","https://openalex.org/W2990327170","https://openalex.org/W3195043235","https://openalex.org/W4205630623","https://openalex.org/W4246392477","https://openalex.org/W4247746673","https://openalex.org/W4253198034"],"related_works":["https://openalex.org/W4287028074","https://openalex.org/W2354764436","https://openalex.org/W3191289342","https://openalex.org/W4288723498","https://openalex.org/W4292730466","https://openalex.org/W4297817344","https://openalex.org/W2555805899","https://openalex.org/W1512669878","https://openalex.org/W2603633312","https://openalex.org/W2792615373"],"abstract_inverted_index":{"Given":[0],"a":[1,12,44],"directed":[2,45,87],"graph":[3,46],"as":[4,25],"input,":[5],"we":[6,26],"show":[7],"how":[8],"to":[9],"efficiently":[10,81],"find":[11],"shortest":[13],"(directed,":[14],"simple)":[15],"cycle":[16,42],"on":[17],"an":[18,80],"even":[19,41],"number":[20],"of":[21,63,85],"vertices.":[22],"As":[23],"far":[24],"know,":[27],"no":[28],"polynomial-time":[29],"algorithm":[30],"was":[31,50],"previously":[32],"known":[33],"for":[34,52],"this":[35],"problem.":[36],"In":[37],"fact,":[38],"finding":[39],"any":[40],"in":[43,47],"polynomial":[48],"time":[49],"open":[51],"more":[53],"than":[54],"two":[55],"decades":[56],"until":[57],"Robertson,":[58],"Seymour,":[59],"and":[60],"Thomas":[61],"(Ann.":[62],"Math.":[64],"(2)":[65],"1999)":[66],"and,":[67],"independently,":[68],"McCuaig":[69],"(Electron.":[70],"J.":[71],"Combin.":[72],"2004;":[73],"announced":[74],"jointly":[75],"at":[76],"STOC":[77],"1997)":[78],"gave":[79],"testable":[82],"structural":[83],"characterisation":[84],"even-cycle-free":[86],"graphs.":[88]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}