{"id":"https://openalex.org/W1991193145","doi":"https://doi.org/10.1002/net.3230100306","title":"An algorithm for finding a short closed spanning walk in a graph","display_name":"An algorithm for finding a short closed spanning walk in a graph","publication_year":1980,"publication_date":"1980-09-01","ids":{"openalex":"https://openalex.org/W1991193145","doi":"https://doi.org/10.1002/net.3230100306","mag":"1991193145"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230100306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230100306","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5035179167","display_name":"K. Takamizawa","orcid":"https://orcid.org/0009-0001-2426-249X"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"K. Takamizawa","raw_affiliation_strings":["Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048687434","display_name":"T. Nishizeki","orcid":null},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Nishizeki","raw_affiliation_strings":["Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027422299","display_name":"Naobumi Saito","orcid":"https://orcid.org/0000-0001-7240-2525"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"N. Saito","raw_affiliation_strings":["Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035179167"],"corresponding_institution_ids":["https://openalex.org/I201537933"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.12011741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"10","issue":"3","first_page":"249","last_page":"263"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9991999864578247,"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/mathematics","display_name":"Mathematics","score":0.625597357749939},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5993896126747131},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5526924729347229},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5276839733123779},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.46180883049964905},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4493534564971924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36251023411750793},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17615213990211487}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.625597357749939},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5993896126747131},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5526924729347229},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5276839733123779},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.46180883049964905},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4493534564971924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36251023411750793},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17615213990211487}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230100306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230100306","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W73739296","https://openalex.org/W1655990431","https://openalex.org/W1971367602","https://openalex.org/W2000467025","https://openalex.org/W2000934872","https://openalex.org/W2033687719","https://openalex.org/W2035089435","https://openalex.org/W2089773331"],"related_works":["https://openalex.org/W2093397072","https://openalex.org/W2075972694","https://openalex.org/W1984327852","https://openalex.org/W2071319668","https://openalex.org/W2949833368","https://openalex.org/W4300545322","https://openalex.org/W1563127162","https://openalex.org/W1562170618","https://openalex.org/W2386162590","https://openalex.org/W4301383227"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"Hamiltonian":[2,30],"walk":[3,11,41,67],"of":[4,12,28,37,42],"a":[5,8,20,29,38,46,64,69],"graph":[6,70],"is":[7],"closed":[9,39,65],"spanning":[10,40,66],"minimum":[13],"length.":[14],"In":[15],"this":[16],"paper":[17],"we":[18,50],"generalize":[19],"Dirac":[21],"type":[22],"sufficient":[23],"condition":[24],"ensuring":[25,34],"the":[26,35],"existence":[27,36],"cycle":[31],"to":[32],"one":[33],"length":[43],"less":[44],"than":[45],"specified":[47],"value.":[48],"Furthermore,":[49],"present":[51],"an":[52],"O":[53],"(":[54],"p":[55,58,72],"2":[56],"log":[57],")":[59],"algorithm":[60],"for":[61],"finding":[62],"such":[63],"in":[68],"with":[71],"vertices":[73],"satisfying":[74],"our":[75],"condition.":[76]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}