{"id":"https://openalex.org/W4296961594","doi":"https://doi.org/10.1007/s00493-021-4736-x","title":"Finding a Shortest Non-Zero Path in Group-Labeled Graphs","display_name":"Finding a Shortest Non-Zero Path in Group-Labeled Graphs","publication_year":2022,"publication_date":"2022-09-21","ids":{"openalex":"https://openalex.org/W4296961594","doi":"https://doi.org/10.1007/s00493-021-4736-x"},"language":"en","primary_location":{"id":"doi:10.1007/s00493-021-4736-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-021-4736-x","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"Combinatorica","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/A5101941539","display_name":"Yoichi Iwata","orcid":"https://orcid.org/0000-0001-7990-2987"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yoichi Iwata","raw_affiliation_strings":["AtCoder Inc., Tokyo, 160-0022, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AtCoder Inc., Tokyo, 160-0022, Japan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039274625","display_name":"Yutaro Yamaguchi","orcid":"https://orcid.org/0000-0002-1919-7195"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yutaro Yamaguchi","raw_affiliation_strings":["Osaka University, Osaka, 565-0871, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Osaka University, Osaka, 565-0871, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039274625"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":0.134,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47254447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"42","issue":"S2","first_page":"1253","last_page":"1282"},"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.9995999932289124,"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.9995999932289124,"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.9979000091552734,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.771767258644104},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7592732906341553},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6695502996444702},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.668018102645874},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6420542597770691},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5824671387672424},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5713980793952942},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5180321335792542},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.48356983065605164},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4364088177680969},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4221253991127014},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4124116003513336},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3305037021636963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2283754050731659}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.771767258644104},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7592732906341553},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6695502996444702},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.668018102645874},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6420542597770691},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5824671387672424},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5713980793952942},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5180321335792542},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.48356983065605164},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4364088177680969},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4221253991127014},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4124116003513336},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3305037021636963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2283754050731659}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00493-021-4736-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-021-4736-x","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"Combinatorica","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":20,"referenced_works":["https://openalex.org/W1507614398","https://openalex.org/W1984537627","https://openalex.org/W2007804392","https://openalex.org/W2013023265","https://openalex.org/W2025861110","https://openalex.org/W2032198109","https://openalex.org/W2054051522","https://openalex.org/W2109920117","https://openalex.org/W2159330890","https://openalex.org/W2169528473","https://openalex.org/W2295069807","https://openalex.org/W2301915442","https://openalex.org/W2467002039","https://openalex.org/W2467159577","https://openalex.org/W2569270235","https://openalex.org/W2995652579","https://openalex.org/W3002550154","https://openalex.org/W3102947642","https://openalex.org/W3118257774","https://openalex.org/W4231740624"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2133099431","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2018146256","https://openalex.org/W2198982833","https://openalex.org/W1504745067","https://openalex.org/W2183791707","https://openalex.org/W2002764510","https://openalex.org/W2040572217"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}