{"id":"https://openalex.org/W2295069807","doi":"https://doi.org/10.1007/s00453-016-0142-y","title":"Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation","display_name":"Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation","publication_year":2016,"publication_date":"2016-03-10","ids":{"openalex":"https://openalex.org/W2295069807","doi":"https://doi.org/10.1007/s00453-016-0142-y","mag":"2295069807"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0142-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0142-y","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://tsukuba.repo.nii.ac.jp/record/41102/files/Algorithmica_77-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074548000","display_name":"Yusuke Kobayashi","orcid":"https://orcid.org/0000-0001-9478-7307"},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yusuke Kobayashi","raw_affiliation_strings":["University of Tsukuba, Tsukuba, Japan"],"affiliations":[{"raw_affiliation_string":"University of Tsukuba, Tsukuba, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030358559","display_name":"Sho Toyooka","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Sho Toyooka","raw_affiliation_strings":["University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074548000"],"corresponding_institution_ids":["https://openalex.org/I146399215"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.7188,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73784244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"77","issue":"4","first_page":"1128","last_page":"1142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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.9976999759674072,"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/T11106","display_name":"Data Management and Algorithms","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/theory-of-computation","display_name":"Theory of computation","score":0.7694892883300781},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.594613790512085},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5902541279792786},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.585695743560791},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.5792579054832458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5152568817138672},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.49069416522979736},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45107501745224},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3997567296028137},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3691362738609314},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2973476052284241},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2682201564311981},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.18554508686065674}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7694892883300781},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.594613790512085},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5902541279792786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.585695743560791},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.5792579054832458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5152568817138672},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.49069416522979736},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45107501745224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3997567296028137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3691362738609314},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2973476052284241},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2682201564311981},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.18554508686065674},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-016-0142-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0142-y","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:tsukuba.repo.nii.ac.jp:00041102","is_oa":true,"landing_page_url":"http://hdl.handle.net/2241/00146051","pdf_url":"https://tsukuba.repo.nii.ac.jp/record/41102/files/Algorithmica_77-4.pdf","source":{"id":"https://openalex.org/S4306402076","display_name":"Terrestrial Environment Research Center (University of Tsukuba)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146399215","host_organization_name":"University of Tsukuba","host_organization_lineage":["https://openalex.org/I146399215"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:tsukuba.repo.nii.ac.jp:00041102","is_oa":true,"landing_page_url":"http://hdl.handle.net/2241/00146051","pdf_url":"https://tsukuba.repo.nii.ac.jp/record/41102/files/Algorithmica_77-4.pdf","source":{"id":"https://openalex.org/S4306402076","display_name":"Terrestrial Environment Research Center (University of Tsukuba)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146399215","host_organization_name":"University of Tsukuba","host_organization_lineage":["https://openalex.org/I146399215"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3159705473","display_name":null,"funder_award_id":"24106002","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3459562248","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8326857615","display_name":"Using dual concepts in graph minor algorithms","funder_award_id":"24700004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8430481527","display_name":null,"funder_award_id":"Number","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320338112","display_name":"Exploratory Research for Advanced Technology","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2295069807.pdf","grobid_xml":"https://content.openalex.org/works/W2295069807.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W15553240","https://openalex.org/W65356316","https://openalex.org/W1539023454","https://openalex.org/W1558273801","https://openalex.org/W1981234161","https://openalex.org/W1985061810","https://openalex.org/W1989949821","https://openalex.org/W2006912660","https://openalex.org/W2007804392","https://openalex.org/W2025311671","https://openalex.org/W2063835992","https://openalex.org/W2082001376","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2610479830","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W2046435967","https://openalex.org/W4231775656","https://openalex.org/W3013650182","https://openalex.org/W4249605382","https://openalex.org/W2183638083","https://openalex.org/W2762130752","https://openalex.org/W2119138398","https://openalex.org/W2598979711","https://openalex.org/W2037384153","https://openalex.org/W2306351532"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
