Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2020556531', 'doi': 'https://doi.org/10.1016/0020-0190(78)90007-8', 'title': "On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs", 'display_name': "On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs", 'publication_year': 1978, 'publication_date': '1978-08-01', 'ids': {'openalex': 'https://openalex.org/W2020556531', 'doi': 'https://doi.org/10.1016/0020-0190(78)90007-8', 'mag': '2020556531'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1016/0020-0190(78)90007-8', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S147953040', 'display_name': 'Information Processing Letters', 'issn_l': '0020-0190', 'issn': ['0020-0190', '1872-6119'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320990', 'host_organization_name': 'Elsevier BV', 'host_organization_lineage': ['https://openalex.org/P4310320990'], 'host_organization_lineage_names': ['Elsevier BV'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5086697652', 'display_name': 'Kohei Noshita', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I20529979', 'display_name': 'University of Electro-Communications', 'ror': 'https://ror.org/02x73b849', 'country_code': 'JP', 'type': 'education', 'lineage': ['https://openalex.org/I20529979']}], 'countries': ['JP'], 'is_corresponding': False, 'raw_author_name': 'Kohei Noshita', 'raw_affiliation_strings': ['Department of Computer Science, The University of Electro-Communications, Chofu, Tokyo 182, Japan'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, The University of Electro-Communications, Chofu, Tokyo 182, Japan', 'institution_ids': ['https://openalex.org/I20529979']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5033971205', 'display_name': 'Etsuo Masuda', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I20529979', 'display_name': 'University of Electro-Communications', 'ror': 'https://ror.org/02x73b849', 'country_code': 'JP', 'type': 'education', 'lineage': ['https://openalex.org/I20529979']}], 'countries': ['JP'], 'is_corresponding': False, 'raw_author_name': 'Etsuo Masuda', 'raw_affiliation_strings': ['Department of Computer Science, The University of Electro-Communications, Chofu, Tokyo 182, Japan'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, The University of Electro-Communications, Chofu, Tokyo 182, Japan', 'institution_ids': ['https://openalex.org/I20529979']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5091452860', 'display_name': 'Hajime Machida', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I20529979', 'display_name': 'University of Electro-Communications', 'ror': 'https://ror.org/02x73b849', 'country_code': 'JP', 'type': 'education', 'lineage': ['https://openalex.org/I20529979']}], 'countries': ['JP'], 'is_corresponding': False, 'raw_author_name': 'Hajime Machida', 'raw_affiliation_strings': ['Department of Computer Science, The University of Electro-Communications, Chofu, Tokyo 182, Japan'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, The University of Electro-Communications, Chofu, Tokyo 182, Japan', 'institution_ids': ['https://openalex.org/I20529979']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': {'value': 2200, 'currency': 'USD', 'value_usd': 2200, 'provenance': 'doaj'}, 'apc_paid': None, 'fwci': 0.788, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 10, 'citation_normalized_percentile': {'value': 0.766382, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 81, 'max': 82}, 'biblio': {'volume': '7', 'issue': '5', 'first_page': '237', 'last_page': '243'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11106', 'display_name': 'Trajectory Data Mining and Analysis', 'score': 0.9995, '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'}}, 'topics': [{'id': 'https://openalex.org/T11106', 'display_name': 'Trajectory Data Mining and Analysis', 'score': 0.9995, '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'}}, {'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/T10317', 'display_name': 'Data Stream Management Systems and Techniques', 'score': 0.9915, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/yens-algorithm', 'display_name': "Yen's algorithm", 'score': 0.6985829}, {'id': 'https://openalex.org/keywords/trajectory-data-mining', 'display_name': 'Trajectory Data Mining', 'score': 0.5158}, {'id': 'https://openalex.org/keywords/approximate-query-processing', 'display_name': 'Approximate Query Processing', 'score': 0.505026}, {'id': 'https://openalex.org/keywords/semantic-trajectories', 'display_name': 'Semantic Trajectories', 'score': 0.501366}, {'id': 'https://openalex.org/keywords/floyd–warshall-algorithm', 'display_name': 'Floyd–Warshall algorithm', 'score': 0.49535644}, {'id': 'https://openalex.org/keywords/euclidean-shortest-path', 'display_name': 'Euclidean shortest path', 'score': 0.45176983}, {'id': 'https://openalex.org/keywords/analysis-of-algorithms', 'display_name': 'Analysis of algorithms', 'score': 0.410862}], 'concepts': [{'id': 'https://openalex.org/C173870130', 'wikidata': 'https://www.wikidata.org/wiki/Q8548', 'display_name': "Dijkstra's algorithm", 'level': 4, 'score': 0.8351155}, {'id': 'https://openalex.org/C70266271', 'wikidata': 'https://www.wikidata.org/wiki/Q6343044', 'display_name': 'K shortest path routing', 'level': 4, 'score': 0.72088665}, {'id': 'https://openalex.org/C168451585', 'wikidata': 'https://www.wikidata.org/wiki/Q7502159', 'display_name': 'Shortest Path Faster Algorithm', 'level': 5, 'score': 0.71969056}, {'id': 'https://openalex.org/C119971455', 'wikidata': 'https://www.wikidata.org/wiki/Q8052172', 'display_name': "Yen's algorithm", 'level': 5, 'score': 0.6985829}, {'id': 'https://openalex.org/C22590252', 'wikidata': 'https://www.wikidata.org/wiki/Q1058754', 'display_name': 'Shortest path problem', 'level': 3, 'score': 0.684181}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.54692155}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.53805155}, {'id': 'https://openalex.org/C1465435', 'wikidata': 'https://www.wikidata.org/wiki/Q2916352', 'display_name': 'Longest path problem', 'level': 4, 'score': 0.53244793}, {'id': 'https://openalex.org/C186065694', 'wikidata': 'https://www.wikidata.org/wiki/Q1047576', 'display_name': 'Floyd–Warshall algorithm', 'level': 5, 'score': 0.49535644}, {'id': 'https://openalex.org/C2777735758', 'wikidata': 'https://www.wikidata.org/wiki/Q817765', 'display_name': 'Path (computing)', 'level': 2, 'score': 0.47506115}, {'id': 'https://openalex.org/C170836113', 'wikidata': 'https://www.wikidata.org/wiki/Q5406126', 'display_name': 'Euclidean shortest path', 'level': 5, 'score': 0.45176983}, {'id': 'https://openalex.org/C64731005', 'wikidata': 'https://www.wikidata.org/wiki/Q333464', 'display_name': 'Analysis of algorithms', 'level': 2, 'score': 0.410862}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.38229752}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.3581884}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.32568204}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.30018914}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.23187333}, {'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': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1016/0020-0190(78)90007-8', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S147953040', 'display_name': 'Information Processing Letters', 'issn_l': '0020-0190', 'issn': ['0020-0190', '1872-6119'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320990', 'host_organization_name': 'Elsevier BV', 'host_organization_lineage': ['https://openalex.org/P4310320990'], 'host_organization_lineage_names': ['Elsevier BV'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 10, 'referenced_works': ['https://openalex.org/W1655990431', 'https://openalex.org/W1905664391', 'https://openalex.org/W1975638108', 'https://openalex.org/W2017927472', 'https://openalex.org/W2022344632', 'https://openalex.org/W2022980325', 'https://openalex.org/W2027580688', 'https://openalex.org/W2058956837', 'https://openalex.org/W2071845176', 'https://openalex.org/W2169528473'], 'related_works': ['https://openalex.org/W4293054712', 'https://openalex.org/W4287366785', 'https://openalex.org/W4200172719', 'https://openalex.org/W3179701043', 'https://openalex.org/W3147002910', 'https://openalex.org/W3121758909', 'https://openalex.org/W2360981904', 'https://openalex.org/W2198982833', 'https://openalex.org/W2020556531', 'https://openalex.org/W2002764510'], 'abstract_inverted_index': {'Shortest': [0], 'path,': [1], 'shortest': [2], 'spanning': [3], 'tree,': [4], 'complete': [5], 'graph,': [6], 'number': [7], 'of': [8], 'comparisons,': [9], 'expected': [10], 'complexity': [11]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2020556531', 'counts_by_year': [{'year': 2013, 'cited_by_count': 1}, {'year': 2012, 'cited_by_count': 1}], 'updated_date': '2024-09-25T11:02:03.998914', 'created_date': '2016-06-24'}