{"id":"https://openalex.org/W2564684643","doi":null,"title":"Further Results on the Shortest Path Counting Problem","display_name":"Further Results on the Shortest Path Counting Problem","publication_year":1991,"publication_date":"1991-10-16","ids":{"openalex":"https://openalex.org/W2564684643","mag":"2564684643"},"language":"ja","primary_location":{"id":"mag:2564684643","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/naid/110003477643","pdf_url":null,"source":{"id":"https://openalex.org/S4306550689","display_name":"\u65e5\u672c\u30aa\u30da\u30ec\u30fc\u30b7\u30e7\u30f3\u30ba\u30fb\u30ea\u30b5\u30fc\u30c1\u5b66\u4f1a\u79cb\u5b63\u7814\u7a76\u767a\u8868\u4f1a\u30a2\u30d6\u30b9\u30c8\u30e9\u30af\u30c8\u96c6","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u65e5\u672c\u30aa\u30da\u30ec\u30fc\u30b7\u30e7\u30f3\u30ba\u30fb\u30ea\u30b5\u30fc\u30c1\u5b66\u4f1a\u79cb\u5b63\u7814\u7a76\u767a\u8868\u4f1a\u30a2\u30d6\u30b9\u30c8\u30e9\u30af\u30c8\u96c6","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5089582199","display_name":"Tatsuo Oyama","orcid":"https://orcid.org/0000-0002-0038-3713","observed_orcids":["https://orcid.org/0000-0002-0038-3713"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tatsuo Oyama","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-0038-3713","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112363716","display_name":"Azuma Taguchi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Azuma Taguchi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.36751618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":"1991","issue":null,"first_page":"166","last_page":"167"},"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.9984999895095825,"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.9984999895095825,"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.00039999998989515007,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.00019999999494757503,"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/shortest-path","display_name":"shortest path","score":0.6489999890327454},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.335999995470047}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5287235379219055},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5130109190940857},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.42202234268188477},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4152989685535431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4130645990371704},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.26792600750923157},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21205317974090576},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12820768356323242},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09070658683776855}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2564684643","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/naid/110003477643","pdf_url":null,"source":{"id":"https://openalex.org/S4306550689","display_name":"\u65e5\u672c\u30aa\u30da\u30ec\u30fc\u30b7\u30e7\u30f3\u30ba\u30fb\u30ea\u30b5\u30fc\u30c1\u5b66\u4f1a\u79cb\u5b63\u7814\u7a76\u767a\u8868\u4f1a\u30a2\u30d6\u30b9\u30c8\u30e9\u30af\u30c8\u96c6","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u65e5\u672c\u30aa\u30da\u30ec\u30fc\u30b7\u30e7\u30f3\u30ba\u30fb\u30ea\u30b5\u30fc\u30c1\u5b66\u4f1a\u79cb\u5b63\u7814\u7a76\u767a\u8868\u4f1a\u30a2\u30d6\u30b9\u30c8\u30e9\u30af\u30c8\u96c6","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W352986592","https://openalex.org/W379642524","https://openalex.org/W409745796","https://openalex.org/W396897486","https://openalex.org/W375084416","https://openalex.org/W643481388","https://openalex.org/W2918064078","https://openalex.org/W1550088383","https://openalex.org/W574262493","https://openalex.org/W592346327"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2017-01-06T00:00:00"}