Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2466934300', 'doi': None, 'title': "On the Average Complexity of Dijkstra's Shortest Path Algorithm", 'display_name': "On the Average Complexity of Dijkstra's Shortest Path Algorithm", 'publication_year': 1988, 'publication_date': '1988-01-01', 'ids': {'openalex': 'https://openalex.org/W2466934300', 'mag': '2466934300'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://iris.unive.it/handle/10278/5773', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], '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/A5062628205', 'display_name': 'Maria Simonetta Balsamo', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Maria Simonetta Balsamo', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5085360967', 'display_name': 'L. Donatiello', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'L. Donatiello', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5059080368', 'display_name': 'Alan A. Bertossi', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'A. Bertossi', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 53}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10142', 'display_name': 'Formal Methods in Software Verification and Control', 'score': 0.9727, '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/T10142', 'display_name': 'Formal Methods in Software Verification and Control', 'score': 0.9727, '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/T12923', 'display_name': 'Connected Component Labeling Algorithms', 'score': 0.9529, 'subfield': {'id': 'https://openalex.org/subfields/1707', 'display_name': 'Computer Vision and Pattern Recognition'}, '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': 'Graph Theory and Algorithms', 'score': 0.952, '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/yens-algorithm', 'display_name': "Yen's algorithm", 'score': 0.69074875}, {'id': 'https://openalex.org/keywords/complexity-classification', 'display_name': 'Complexity Classification', 'score': 0.642078}, {'id': 'https://openalex.org/keywords/parameterized-complexity', 'display_name': 'Parameterized Complexity', 'score': 0.628421}, {'id': 'https://openalex.org/keywords/approximation-algorithms', 'display_name': 'Approximation Algorithms', 'score': 0.607755}, {'id': 'https://openalex.org/keywords/discrete-geometry', 'display_name': 'Discrete Geometry', 'score': 0.557655}, {'id': 'https://openalex.org/keywords/probabilistic-systems', 'display_name': 'Probabilistic Systems', 'score': 0.556199}], 'concepts': [{'id': 'https://openalex.org/C173870130', 'wikidata': 'https://www.wikidata.org/wiki/Q8548', 'display_name': "Dijkstra's algorithm", 'level': 4, 'score': 0.6926369}, {'id': 'https://openalex.org/C119971455', 'wikidata': 'https://www.wikidata.org/wiki/Q8052172', 'display_name': "Yen's algorithm", 'level': 5, 'score': 0.69074875}, {'id': 'https://openalex.org/C70266271', 'wikidata': 'https://www.wikidata.org/wiki/Q6343044', 'display_name': 'K shortest path routing', 'level': 4, 'score': 0.5914138}, {'id': 'https://openalex.org/C168451585', 'wikidata': 'https://www.wikidata.org/wiki/Q7502159', 'display_name': 'Shortest Path Faster Algorithm', 'level': 5, 'score': 0.58899325}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.5345397}, {'id': 'https://openalex.org/C22590252', 'wikidata': 'https://www.wikidata.org/wiki/Q1058754', 'display_name': 'Shortest path problem', 'level': 3, 'score': 0.52602726}, {'id': 'https://openalex.org/C2777735758', 'wikidata': 'https://www.wikidata.org/wiki/Q817765', 'display_name': 'Path (computing)', 'level': 2, 'score': 0.51063377}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.49143565}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.3728245}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.2655461}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.12942302}, {'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://iris.unive.it/handle/10278/5773', 'pdf_url': None, 'source': None, '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': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W582340002', 'https://openalex.org/W3209614263', 'https://openalex.org/W3138148611', 'https://openalex.org/W3129923565', 'https://openalex.org/W3015636702', 'https://openalex.org/W2994418462', 'https://openalex.org/W2940872763', 'https://openalex.org/W2918064078', 'https://openalex.org/W2918039298', 'https://openalex.org/W2808332191', 'https://openalex.org/W2796327753', 'https://openalex.org/W2398424124', 'https://openalex.org/W2387644816', 'https://openalex.org/W2376206731', 'https://openalex.org/W2349091433', 'https://openalex.org/W2163460271', 'https://openalex.org/W2031116793', 'https://openalex.org/W2020556531', 'https://openalex.org/W1563903492', 'https://openalex.org/W1550088383'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2466934300', 'counts_by_year': [], 'updated_date': '2024-09-16T19:05:49.984425', 'created_date': '2016-07-22'}