Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2724490429', 'doi': 'https://doi.org/10.15807/torsj.54.58', 'title': "FAST IMPLEMENTATION OF DIJKSTRA'S ALGORITHM FOR THE LARGE-SCALE SHORTEST PATH PROBLEM", 'display_name': "FAST IMPLEMENTATION OF DIJKSTRA'S ALGORITHM FOR THE LARGE-SCALE SHORTEST PATH PROBLEM", 'publication_year': 2011, 'publication_date': '2011-01-01', 'ids': {'openalex': 'https://openalex.org/W2724490429', 'doi': 'https://doi.org/10.15807/torsj.54.58', 'mag': '2724490429'}, 'language': 'en', 'primary_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.15807/torsj.54.58', 'pdf_url': 'https://www.jstage.jst.go.jp/article/torsj/54/0/54_KJ00007756660/_pdf', 'source': {'id': 'https://openalex.org/S4210191835', 'display_name': 'Transactions of the Operations Research Society of Japan', 'issn_l': '1349-8940', 'issn': ['1349-8940', '2188-8280'], 'is_oa': True, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': True, 'oa_status': 'bronze', 'oa_url': 'https://www.jstage.jst.go.jp/article/torsj/54/0/54_KJ00007756660/_pdf', 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5100924930', 'display_name': 'Yuichiro Yasui', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I96679780', 'display_name': 'Chuo University', 'ror': 'https://ror.org/03qvqb743', 'country_code': 'JP', 'type': 'education', 'lineage': ['https://openalex.org/I96679780']}], 'countries': ['JP'], 'is_corresponding': False, 'raw_author_name': 'Yuichiro Yasui', 'raw_affiliation_strings': ['Chuo University'], 'affiliations': [{'raw_affiliation_string': 'Chuo University', 'institution_ids': ['https://openalex.org/I96679780']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5067662454', 'display_name': 'Katsuki Fujisawa', 'orcid': 'https://orcid.org/0000-0001-8549-641X'}, 'institutions': [{'id': 'https://openalex.org/I96679780', 'display_name': 'Chuo University', 'ror': 'https://ror.org/03qvqb743', 'country_code': 'JP', 'type': 'education', 'lineage': ['https://openalex.org/I96679780']}], 'countries': ['JP'], 'is_corresponding': False, 'raw_author_name': 'Katsuki Fujisawa', 'raw_affiliation_strings': ['Chuo University'], 'affiliations': [{'raw_affiliation_string': 'Chuo University', 'institution_ids': ['https://openalex.org/I96679780']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5056544784', 'display_name': 'Hiroshi Sasajima', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I96679780', 'display_name': 'Chuo University', 'ror': 'https://ror.org/03qvqb743', 'country_code': 'JP', 'type': 'education', 'lineage': ['https://openalex.org/I96679780']}], 'countries': ['JP'], 'is_corresponding': False, 'raw_author_name': 'Hiroshi Sasajima', 'raw_affiliation_strings': ['Chuo University'], 'affiliations': [{'raw_affiliation_string': 'Chuo University', 'institution_ids': ['https://openalex.org/I96679780']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5043861789', 'display_name': 'Kazushige Goto', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I4210105678', 'display_name': 'Microsoft (Finland)', 'ror': 'https://ror.org/01nehjf29', 'country_code': 'FI', 'type': 'company', 'lineage': ['https://openalex.org/I1290206253', 'https://openalex.org/I4210105678']}], 'countries': ['FI'], 'is_corresponding': False, 'raw_author_name': 'Kazushige Goto', 'raw_affiliation_strings': ['Microsoft Corporation'], 'affiliations': [{'raw_affiliation_string': 'Microsoft Corporation', 'institution_ids': ['https://openalex.org/I4210105678']}]}], 'countries_distinct_count': 2, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 2, 'citation_normalized_percentile': {'value': 0.442096, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 73, 'max': 76}, 'biblio': {'volume': '54', 'issue': '0', 'first_page': '58', 'last_page': '83'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Combinatorial Optimization and Complexity Theory', 'score': 0.9972, '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': 'Combinatorial Optimization and Complexity Theory', 'score': 0.9972, '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': 'Mesh Generation Algorithms', 'score': 0.9939, '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'}}, {'id': 'https://openalex.org/T11106', 'display_name': 'Trajectory Data Mining and Analysis', 'score': 0.9923, '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/approximation-algorithms', 'display_name': 'Approximation Algorithms', 'score': 0.611358}, {'id': 'https://openalex.org/keywords/algorithmic-applications', 'display_name': 'Algorithmic Applications', 'score': 0.589106}, {'id': 'https://openalex.org/keywords/combinatorial-optimization', 'display_name': 'Combinatorial Optimization', 'score': 0.582226}, {'id': 'https://openalex.org/keywords/geometric-optimization', 'display_name': 'Geometric Optimization', 'score': 0.573349}, {'id': 'https://openalex.org/keywords/yens-algorithm', 'display_name': "Yen's algorithm", 'score': 0.5733476}, {'id': 'https://openalex.org/keywords/matrix-multiplication', 'display_name': 'Matrix Multiplication', 'score': 0.561236}], 'concepts': [{'id': 'https://openalex.org/C173870130', 'wikidata': 'https://www.wikidata.org/wiki/Q8548', 'display_name': "Dijkstra's algorithm", 'level': 4, 'score': 0.8528082}, {'id': 'https://openalex.org/C22590252', 'wikidata': 'https://www.wikidata.org/wiki/Q1058754', 'display_name': 'Shortest path problem', 'level': 3, 'score': 0.63490325}, {'id': 'https://openalex.org/C70266271', 'wikidata': 'https://www.wikidata.org/wiki/Q6343044', 'display_name': 'K shortest path routing', 'level': 4, 'score': 0.60014623}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.585143}, {'id': 'https://openalex.org/C119971455', 'wikidata': 'https://www.wikidata.org/wiki/Q8052172', 'display_name': "Yen's algorithm", 'level': 5, 'score': 0.5733476}, {'id': 'https://openalex.org/C2778755073', 'wikidata': 'https://www.wikidata.org/wiki/Q10858537', 'display_name': 'Scale (ratio)', 'level': 2, 'score': 0.56038964}, {'id': 'https://openalex.org/C2777735758', 'wikidata': 'https://www.wikidata.org/wiki/Q817765', 'display_name': 'Path (computing)', 'level': 2, 'score': 0.5026345}, {'id': 'https://openalex.org/C25321074', 'wikidata': 'https://www.wikidata.org/wiki/Q1969601', 'display_name': 'Pathfinding', 'level': 4, 'score': 0.49778223}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.4504557}, {'id': 'https://openalex.org/C168451585', 'wikidata': 'https://www.wikidata.org/wiki/Q7502159', 'display_name': 'Shortest Path Faster Algorithm', 'level': 5, 'score': 0.4421733}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.23640296}, {'id': 'https://openalex.org/C205649164', 'wikidata': 'https://www.wikidata.org/wiki/Q1071', 'display_name': 'Geography', 'level': 0, 'score': 0.10618633}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.060747713}, {'id': 'https://openalex.org/C199360897', 'wikidata': 'https://www.wikidata.org/wiki/Q9143', 'display_name': 'Programming language', 'level': 1, 'score': 0.04824084}, {'id': 'https://openalex.org/C58640448', 'wikidata': 'https://www.wikidata.org/wiki/Q42515', 'display_name': 'Cartography', 'level': 1, 'score': 0.043614566}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': True, 'landing_page_url': 'https://doi.org/10.15807/torsj.54.58', 'pdf_url': 'https://www.jstage.jst.go.jp/article/torsj/54/0/54_KJ00007756660/_pdf', 'source': {'id': 'https://openalex.org/S4210191835', 'display_name': 'Transactions of the Operations Research Society of Japan', 'issn_l': '1349-8940', 'issn': ['1349-8940', '2188-8280'], 'is_oa': True, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}], 'best_oa_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.15807/torsj.54.58', 'pdf_url': 'https://www.jstage.jst.go.jp/article/torsj/54/0/54_KJ00007756660/_pdf', 'source': {'id': 'https://openalex.org/S4210191835', 'display_name': 'Transactions of the Operations Research Society of Japan', 'issn_l': '1349-8940', 'issn': ['1349-8940', '2188-8280'], 'is_oa': True, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 17, 'referenced_works': ['https://openalex.org/W1510642760', 'https://openalex.org/W1528485123', 'https://openalex.org/W1537256577', 'https://openalex.org/W1555915743', 'https://openalex.org/W1655990431', 'https://openalex.org/W1978757752', 'https://openalex.org/W2073061372', 'https://openalex.org/W2084224084', 'https://openalex.org/W2084379367', 'https://openalex.org/W2085917651', 'https://openalex.org/W2151400766', 'https://openalex.org/W2169528473', 'https://openalex.org/W2439405256', 'https://openalex.org/W3137299218', 'https://openalex.org/W3145128584', 'https://openalex.org/W3198470706', 'https://openalex.org/W4240200084'], 'related_works': ['https://openalex.org/W4253588386', 'https://openalex.org/W3015233512', 'https://openalex.org/W2886722595', 'https://openalex.org/W2810620529', 'https://openalex.org/W2514247065', 'https://openalex.org/W2387829241', 'https://openalex.org/W2367161887', 'https://openalex.org/W2348177054', 'https://openalex.org/W2136320479', 'https://openalex.org/W1562631103'], 'abstract_inverted_index': {'最短路問題はネットワーク上の経路探索などの多くの応用を持ち,また他の最適化問題の子問題として用いられることも多く,適用範囲の広い組合せ最適化問題である.そのため最短路問題を高速に解くことの重要性は非常に大きくなってきている.最短路問題に対する解法としてはダイクストラ法などの安定的かつ効率的な高速アルゴリズムが存在するが,実問題は非常に大規模になるためさらなる高速化が不可欠である.そこで本論文では大規模最短路問題に対し,計算機のメモリ階層構造を考慮しつつ汎用的かつ効率的に高速化を行うための実装方法を示す.さらに論文中では計算機のメモリ階層構造における律速箇所の特定を行うための汎用的な解析方法を示し,高速化の有用性を検証していく.本手法により実装されたバイナリ・ヒープを適用したダイクストラ法は,実行性能,安定性,メモリ要求量などを他の実装と比較すると総合的に最も優れているといえる.また本実装を用いた大規模最短路問題に対するオンライン・ソルバーについても説明を行う.': [0]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2724490429', 'counts_by_year': [{'year': 2024, 'cited_by_count': 1}, {'year': 2018, 'cited_by_count': 1}], 'updated_date': '2024-09-13T09:49:28.982512', 'created_date': '2017-07-14'}