Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W1574303240', 'doi': None, 'title': 'Algorithmic graph theory', 'display_name': 'Algorithmic graph theory', 'publication_year': 1985, 'publication_date': '1985-01-01', 'ids': {'openalex': 'https://openalex.org/W1574303240', 'mag': '1574303240'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://ci.nii.ac.jp/ncid/BA03554330', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306462995', 'display_name': 'Cambridge University Press eBooks', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310311721', 'host_organization_name': 'Cambridge University Press', 'host_organization_lineage': ['https://openalex.org/P4310311721', 'https://openalex.org/P4310311702'], 'host_organization_lineage_names': ['Cambridge University Press', 'University of Cambridge'], 'type': 'ebook platform'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'book', 'type_crossref': 'book', '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/A5078769517', 'display_name': 'Alan Gibbons', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'Alan Gibbons', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5078769517'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.267, 'has_fulltext': False, 'cited_by_count': 861, 'citation_normalized_percentile': {'value': 0.896552, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 99, 'max': 100}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10374', 'display_name': 'Graph Theory and Algorithms', 'score': 0.9774, '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/T10374', 'display_name': 'Graph Theory and Algorithms', 'score': 0.9774, '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/T12541', 'display_name': 'Graph Labeling and Dimension Problems', 'score': 0.9642, '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/graph-theory', 'display_name': 'Graph Theory', 'score': 0.576023}, {'id': 'https://openalex.org/keywords/graph-labeling', 'display_name': 'Graph Labeling', 'score': 0.557208}, {'id': 'https://openalex.org/keywords/algorithmic-applications', 'display_name': 'Algorithmic Applications', 'score': 0.555652}, {'id': 'https://openalex.org/keywords/parameterized-complexity', 'display_name': 'Parameterized Complexity', 'score': 0.53146}, {'id': 'https://openalex.org/keywords/computational-complexity', 'display_name': 'Computational Complexity', 'score': 0.528912}, {'id': 'https://openalex.org/keywords/hamiltonian-path-problem', 'display_name': 'Hamiltonian path problem', 'score': 0.43177816}, {'id': 'https://openalex.org/keywords/indifference-graph', 'display_name': 'Indifference graph', 'score': 0.41449007}], 'concepts': [{'id': 'https://openalex.org/C43058520', 'wikidata': 'https://www.wikidata.org/wiki/Q624580', 'display_name': 'Eulerian path', 'level': 3, 'score': 0.65760154}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.5691154}, {'id': 'https://openalex.org/C101837359', 'wikidata': 'https://www.wikidata.org/wiki/Q547823', 'display_name': 'Planar graph', 'level': 3, 'score': 0.5302244}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.47061473}, {'id': 'https://openalex.org/C43517604', 'wikidata': 'https://www.wikidata.org/wiki/Q7144893', 'display_name': 'Pathwidth', 'level': 4, 'score': 0.44563368}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.43584338}, {'id': 'https://openalex.org/C104737047', 'wikidata': 'https://www.wikidata.org/wiki/Q987652', 'display_name': 'Hamiltonian path problem', 'level': 4, 'score': 0.43177816}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.4194522}, {'id': 'https://openalex.org/C74133993', 'wikidata': 'https://www.wikidata.org/wiki/Q3115472', 'display_name': 'Indifference graph', 'level': 3, 'score': 0.41449007}, {'id': 'https://openalex.org/C86524685', 'wikidata': 'https://www.wikidata.org/wiki/Q273037', 'display_name': 'Hamiltonian path', 'level': 3, 'score': 0.38863415}, {'id': 'https://openalex.org/C203776342', 'wikidata': 'https://www.wikidata.org/wiki/Q1378376', 'display_name': 'Line graph', 'level': 3, 'score': 0.38101107}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.3751582}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.36627537}, {'id': 'https://openalex.org/C53469067', 'wikidata': 'https://www.wikidata.org/wiki/Q505735', 'display_name': 'Lagrangian', 'level': 2, 'score': 0.08478829}, {'id': 'https://openalex.org/C202444582', 'wikidata': 'https://www.wikidata.org/wiki/Q837863', 'display_name': 'Pure mathematics', 'level': 1, 'score': 0.06549218}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'http://ci.nii.ac.jp/ncid/BA03554330', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306462995', 'display_name': 'Cambridge University Press eBooks', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310311721', 'host_organization_name': 'Cambridge University Press', 'host_organization_lineage': ['https://openalex.org/P4310311721', 'https://openalex.org/P4310311702'], 'host_organization_lineage_names': ['Cambridge University Press', 'University of Cambridge'], 'type': 'ebook platform'}, '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/W3145128584', 'https://openalex.org/W2799004609', 'https://openalex.org/W2340365916', 'https://openalex.org/W2169528473', 'https://openalex.org/W2148606196', 'https://openalex.org/W2143474538', 'https://openalex.org/W2124637492', 'https://openalex.org/W2118382442', 'https://openalex.org/W2112090702', 'https://openalex.org/W2107580999', 'https://openalex.org/W2061901927', 'https://openalex.org/W2053913299', 'https://openalex.org/W2017927472', 'https://openalex.org/W2011039300', 'https://openalex.org/W2008620264', 'https://openalex.org/W1971421925', 'https://openalex.org/W1655990431', 'https://openalex.org/W1558273801', 'https://openalex.org/W1484040084', 'https://openalex.org/W1479863711'], 'abstract_inverted_index': {'Preface': [0], '1.': [1], 'Introducing': [2], 'graphs': [3, 14, 28], 'and': [4, 10, 17, 23, 32], 'algorithmic': [5], 'complexity': [6], '2.': [7], 'Spanning-trees,': [8], 'branchings': [9], 'connectivity': [11], '3.': [12], 'Planar': [13], '4.': [15], 'Networks': [16], 'flows': [18], '5.': [19], 'Matchings': [20], '6.': [21], 'Eulerian': [22], 'Hamiltonian': [24], 'tours': [25], '7.': [26], 'Colouring': [27], '8.': [29], 'Graph': [30], 'problems': [31], 'intractability': [33], 'Appendix': [34], 'Author': [35], 'Index': [36], 'Subject': [37], 'Index.': [38]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1574303240', 'counts_by_year': [{'year': 2022, 'cited_by_count': 3}, {'year': 2021, 'cited_by_count': 14}, {'year': 2020, 'cited_by_count': 13}, {'year': 2019, 'cited_by_count': 17}, {'year': 2018, 'cited_by_count': 27}, {'year': 2017, 'cited_by_count': 28}, {'year': 2016, 'cited_by_count': 20}, {'year': 2015, 'cited_by_count': 29}, {'year': 2014, 'cited_by_count': 34}, {'year': 2013, 'cited_by_count': 29}, {'year': 2012, 'cited_by_count': 41}], 'updated_date': '2024-09-15T20:35:05.337424', 'created_date': '2016-06-24'}