{"id":"https://openalex.org/W2054279301","doi":"https://doi.org/10.1137/s0097539792234378","title":"Minimum Cost Paths in Periodic Graphs","display_name":"Minimum Cost Paths in Periodic Graphs","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W2054279301","doi":"https://doi.org/10.1137/s0097539792234378","mag":"2054279301"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792234378","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792234378","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5025216253","display_name":"Franz H\u00f6fting","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Franz H\u00f6fting","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5069174754","display_name":"Egon Wanke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Egon Wanke","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025216253"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1259,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.91490858,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"24","issue":"5","first_page":"1051","last_page":"1067"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9980999827384949,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9980999827384949,"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.9969000220298767,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9944000244140625,"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/mathematics","display_name":"Mathematics","score":0.7146080136299133},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6751418113708496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6563765406608582},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5493547320365906},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5402370095252991},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4983806610107422},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48571544885635376},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45780277252197266},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4326157569885254},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.21051087975502014},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17644062638282776},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15615522861480713},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06532716751098633}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7146080136299133},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6751418113708496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6563765406608582},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5493547320365906},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5402370095252991},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4983806610107422},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48571544885635376},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45780277252197266},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4326157569885254},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.21051087975502014},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17644062638282776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15615522861480713},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06532716751098633},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792234378","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792234378","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":11,"referenced_works":["https://openalex.org/W1973458874","https://openalex.org/W2002252837","https://openalex.org/W2014108043","https://openalex.org/W2026261955","https://openalex.org/W2103658959","https://openalex.org/W2114616381","https://openalex.org/W2401610261","https://openalex.org/W2408253508","https://openalex.org/W2505968561","https://openalex.org/W2581341131","https://openalex.org/W4233558979"],"related_works":["https://openalex.org/W2132921321","https://openalex.org/W2065006817","https://openalex.org/W2129550502","https://openalex.org/W2116465486","https://openalex.org/W2101572961","https://openalex.org/W1995629993","https://openalex.org/W1759713541","https://openalex.org/W2551933747","https://openalex.org/W2045633099","https://openalex.org/W2135694842"],"abstract_inverted_index":{"We":[0,16],"consider":[1],"graphs":[2],"with":[3,13],"d-dimensional":[4],"integral":[5],"vector":[6,33,45,69,78],"weights":[7,70,79],"and":[8,76],"rational":[9],"cost":[10,24,62],"values":[11],"associated":[12],"the":[14,18,32,39,65,68,77,84],"edges.":[15],"analyze":[17],"problem":[19],"of":[20,35,67],"finding":[21,58],"a":[22,42,60,74],"minimum":[23,61],"path":[25,40],"between":[26],"two":[27],"given":[28,43],"vertices":[29],"such":[30,59],"that":[31,51],"sum":[34],"all":[36],"edges":[37],"in":[38],"equals":[41],"target":[44],"m.":[46],"The":[47],"present":[48],"paper":[49],"shows":[50],"there":[52],"are":[53,80],"polynomial":[54],"time":[55],"algorithms":[56],"for":[57],"m-path":[63],"if":[64],"dimension":[66],"is":[71,87],"bounded":[72],"by":[73],"constant":[75],"represented":[81],"unary,":[82],"where":[83],"general":[85],"version":[86],"NP-complete":[88],"under":[89],"various":[90],"restrictions.":[91]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}