Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W3143097445', 'doi': None, 'title': 'A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs', 'display_name': 'A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs', 'publication_year': 2011, 'publication_date': '2011-01-01', 'ids': {'openalex': 'https://openalex.org/W3143097445', 'mag': '3143097445'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://ir.ncnu.edu.tw/handle/310010000/6398', 'pdf_url': None, '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/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'journal'}, '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/A5010815779', 'display_name': '阮夙姿', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': '阮夙姿', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5060586870', 'display_name': 'Jst Juan', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Jst Juan', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': {'value': 2290, 'currency': 'EUR', 'value_usd': 2890, 'provenance': 'doaj'}, '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': 65}, 'biblio': {'volume': None, 'issue': '2', 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T12292', 'display_name': 'Graph Matching and Analysis Techniques', 'score': 0.9935, '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'}}, 'topics': [{'id': 'https://openalex.org/T12292', 'display_name': 'Graph Matching and Analysis Techniques', 'score': 0.9935, '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/T11106', 'display_name': 'Trajectory Data Mining and Analysis', 'score': 0.9908, '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/T10317', 'display_name': 'Data Stream Management Systems and Techniques', 'score': 0.9766, '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/graph-matching', 'display_name': 'Graph Matching', 'score': 0.678041}, {'id': 'https://openalex.org/keywords/graph-processing', 'display_name': 'Graph Processing', 'score': 0.657609}, {'id': 'https://openalex.org/keywords/large-scale-graphs', 'display_name': 'Large-scale Graphs', 'score': 0.657388}, {'id': 'https://openalex.org/keywords/theory-of-computation', 'display_name': 'Theory of computation', 'score': 0.6401169}, {'id': 'https://openalex.org/keywords/approximate-query-processing', 'display_name': 'Approximate Query Processing', 'score': 0.61238}, {'id': 'https://openalex.org/keywords/parallel-algorithms', 'display_name': 'Parallel Algorithms', 'score': 0.605168}, {'id': 'https://openalex.org/keywords/floyd–warshall-algorithm', 'display_name': 'Floyd–Warshall algorithm', 'score': 0.48244458}], 'concepts': [{'id': 'https://openalex.org/C24858836', 'wikidata': 'https://www.wikidata.org/wiki/Q844718', 'display_name': 'Theory of computation', 'level': 2, 'score': 0.6401169}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.5705622}, {'id': 'https://openalex.org/C22590252', 'wikidata': 'https://www.wikidata.org/wiki/Q1058754', 'display_name': 'Shortest path problem', 'level': 3, 'score': 0.5592757}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.51051605}, {'id': 'https://openalex.org/C129844170', 'wikidata': 'https://www.wikidata.org/wiki/Q41299', 'display_name': 'Quadratic equation', 'level': 2, 'score': 0.4899239}, {'id': 'https://openalex.org/C186065694', 'wikidata': 'https://www.wikidata.org/wiki/Q1047576', 'display_name': 'Floyd–Warshall algorithm', 'level': 5, 'score': 0.48244458}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.46295434}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.44495973}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.37378967}, {'id': 'https://openalex.org/C70266271', 'wikidata': 'https://www.wikidata.org/wiki/Q6343044', 'display_name': 'K shortest path routing', 'level': 4, 'score': 0.31153548}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.25342196}, {'id': 'https://openalex.org/C2524010', 'wikidata': 'https://www.wikidata.org/wiki/Q8087', 'display_name': 'Geometry', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'http://ir.ncnu.edu.tw/handle/310010000/6398', 'pdf_url': None, '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/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], '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': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W3149063625', 'https://openalex.org/W2963926123', 'https://openalex.org/W2893192684', 'https://openalex.org/W2811828991', 'https://openalex.org/W2614203520', 'https://openalex.org/W2391130892', 'https://openalex.org/W2374861956', 'https://openalex.org/W2371482997', 'https://openalex.org/W2366342492', 'https://openalex.org/W2286127703', 'https://openalex.org/W2133099431', 'https://openalex.org/W2125205064', 'https://openalex.org/W2088250058', 'https://openalex.org/W2073094163', 'https://openalex.org/W2072016939', 'https://openalex.org/W2058956837', 'https://openalex.org/W2036556874', 'https://openalex.org/W1973804680', 'https://openalex.org/W1817899449', 'https://openalex.org/W1497433128'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3143097445', 'counts_by_year': [], 'updated_date': '2024-09-25T04:38:41.794307', 'created_date': '2021-04-13'}