{"id":"https://openalex.org/W146202307","doi":"https://doi.org/10.1007/bf02251238","title":"The complexity of determining a shortest cycle of even length","display_name":"The complexity of determining a shortest cycle of even length","publication_year":1983,"publication_date":"1983-12-01","ids":{"openalex":"https://openalex.org/W146202307","doi":"https://doi.org/10.1007/bf02251238","mag":"146202307"},"language":"en","primary_location":{"id":"doi:10.1007/bf02251238","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02251238","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086678348","display_name":"Burkhard Monien","orcid":"https://orcid.org/0000-0003-2334-6795"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"B. Monien","raw_affiliation_strings":["Fachbereich Mathematik/Informatik, Universit\u00e4t Paderborn, Warburger Strasse 100, D-4790, Paderborn, Federal Republic of Germany","Fachbereich Mathematik/Informatik, Universit\u00e4t Paderborn, Paderborn, Federal Republic of Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik/Informatik, Universit\u00e4t Paderborn, Warburger Strasse 100, D-4790, Paderborn, Federal Republic of Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Fachbereich Mathematik/Informatik, Universit\u00e4t Paderborn, Paderborn, Federal Republic of Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086678348"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.2813,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.84923252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"4","first_page":"355","last_page":"369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9623000025749207,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9623000025749207,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9534000158309937,"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/T11567","display_name":"semigroups and automata theory","score":0.9186000227928162,"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.6387012600898743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6331236362457275},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.5255203247070312},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.501777172088623},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4378427565097809},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43152034282684326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39733171463012695},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12644609808921814},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.10829344391822815}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6387012600898743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6331236362457275},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.5255203247070312},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.501777172088623},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4378427565097809},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43152034282684326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39733171463012695},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12644609808921814},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.10829344391822815}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02251238","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02251238","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1991858502","https://openalex.org/W2082001376","https://openalex.org/W2137572956","https://openalex.org/W2340365916","https://openalex.org/W3158027121"],"related_works":["https://openalex.org/W2995136638","https://openalex.org/W168853239","https://openalex.org/W2000631615","https://openalex.org/W2064884450","https://openalex.org/W2888987890","https://openalex.org/W4299954585","https://openalex.org/W2314896961","https://openalex.org/W4301701546","https://openalex.org/W2365973956","https://openalex.org/W4210658517"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}