Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W1576317141', 'doi': 'https://doi.org/10.1007/3-540-61422-2_121', 'title': 'The constrained minimum spanning tree problem', 'display_name': 'The constrained minimum spanning tree problem', 'publication_year': 1996, 'publication_date': '1996-01-01', 'ids': {'openalex': 'https://openalex.org/W1576317141', 'doi': 'https://doi.org/10.1007/3-540-61422-2_121', 'mag': '1576317141'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/3-540-61422-2_121', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S106296714', 'display_name': 'Lecture notes in computer science', 'issn_l': '0302-9743', 'issn': ['0302-9743', '1611-3349'], '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': 'book series'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'book-chapter', 'type_crossref': 'book-chapter', '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/A5087844619', 'display_name': 'R. Ravi', 'orcid': 'https://orcid.org/0000-0001-7603-1207'}, 'institutions': [{'id': 'https://openalex.org/I74973139', 'display_name': 'Carnegie Mellon University', 'ror': 'https://ror.org/05x2bcf33', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I74973139']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'R. Ravi', 'raw_affiliation_strings': ['GSIA, Carnegie Mellon University, 5000 Forbes Avenue, 15213, Pittsburgh, PA'], 'affiliations': [{'raw_affiliation_string': 'GSIA, Carnegie Mellon University, 5000 Forbes Avenue, 15213, Pittsburgh, PA', 'institution_ids': ['https://openalex.org/I74973139']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5112204422', 'display_name': 'M. X. Goemans', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I4210110987', 'display_name': 'IIT@MIT', 'ror': 'https://ror.org/01wp8zh54', 'country_code': 'US', 'type': 'facility', 'lineage': ['https://openalex.org/I30771326', 'https://openalex.org/I4210110987']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'M. X. Goemans', 'raw_affiliation_strings': ['Department of Mathematics, MIT, Room 2-382, 02139, Cambridge, MA'], 'affiliations': [{'raw_affiliation_string': 'Department of Mathematics, MIT, Room 2-382, 02139, Cambridge, MA', 'institution_ids': ['https://openalex.org/I4210110987']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': {'value': 5000, 'currency': 'EUR', 'value_usd': 5392, 'provenance': 'doaj'}, 'apc_paid': None, 'fwci': 3.187, 'has_fulltext': False, 'cited_by_count': 130, 'citation_normalized_percentile': {'value': 0.999022, 'is_in_top_1_percent': True, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 97, 'max': 98}, 'biblio': {'volume': None, 'issue': None, 'first_page': '66', 'last_page': '75'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9986, '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': 'Complexity and Algorithms in Graphs', 'score': 0.9986, '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/T10374', 'display_name': 'Advanced Graph Theory Research', 'score': 0.997, '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': 'Computational Geometry and Mesh Generation', 'score': 0.9962, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.68780637}, {'id': 'https://openalex.org/keywords/minimum-weight', 'display_name': 'Minimum weight', 'score': 0.67718655}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.5661467}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.5403384}, {'id': 'https://openalex.org/keywords/adjacency-list', 'display_name': 'Adjacency list', 'score': 0.5078512}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.4917007}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.46667802}], 'concepts': [{'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8317034}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.7569399}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.6927049}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.68780637}, {'id': 'https://openalex.org/C2778945305', 'wikidata': 'https://www.wikidata.org/wiki/Q6865502', 'display_name': 'Minimum weight', 'level': 2, 'score': 0.67718655}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.6542927}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.61393255}, {'id': 'https://openalex.org/C23394520', 'wikidata': 'https://www.wikidata.org/wiki/Q4919350', 'display_name': 'Shortest-path tree', 'level': 3, 'score': 0.5819336}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.5661467}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.55496633}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.5403384}, {'id': 'https://openalex.org/C106286213', 'wikidata': 'https://www.wikidata.org/wiki/Q898572', 'display_name': 'Matroid', 'level': 2, 'score': 0.53631055}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.5277898}, {'id': 'https://openalex.org/C110484373', 'wikidata': 'https://www.wikidata.org/wiki/Q264398', 'display_name': 'Adjacency list', 'level': 2, 'score': 0.5078512}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.4925788}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.4917007}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.4851971}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.46667802}, {'id': 'https://openalex.org/C162307627', 'wikidata': 'https://www.wikidata.org/wiki/Q204833', 'display_name': 'Enhanced Data Rates for GSM Evolution', 'level': 2, 'score': 0.44601113}, {'id': 'https://openalex.org/C311688', 'wikidata': 'https://www.wikidata.org/wiki/Q2393193', 'display_name': 'Time complexity', 'level': 2, 'score': 0.42145252}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.38001317}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.1804907}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.07370266}, {'id': 'https://openalex.org/C76155785', 'wikidata': 'https://www.wikidata.org/wiki/Q418', 'display_name': 'Telecommunications', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/3-540-61422-2_121', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S106296714', 'display_name': 'Lecture notes in computer science', 'issn_l': '0302-9743', 'issn': ['0302-9743', '1611-3349'], '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': 'book series'}, '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': 13, 'referenced_works': ['https://openalex.org/W1968143987', 'https://openalex.org/W1969605458', 'https://openalex.org/W1972897119', 'https://openalex.org/W1991407520', 'https://openalex.org/W2002764437', 'https://openalex.org/W2018804864', 'https://openalex.org/W201971680', 'https://openalex.org/W2034112563', 'https://openalex.org/W2035177959', 'https://openalex.org/W2097004206', 'https://openalex.org/W2133044393', 'https://openalex.org/W2505968561', 'https://openalex.org/W2752885492'], 'related_works': ['https://openalex.org/W3081212354', 'https://openalex.org/W3016811403', 'https://openalex.org/W2943635264', 'https://openalex.org/W2518240130', 'https://openalex.org/W2390742649', 'https://openalex.org/W2361573941', 'https://openalex.org/W2353822696', 'https://openalex.org/W2281826919', 'https://openalex.org/W2130375301', 'https://openalex.org/W1576317141'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1576317141', 'counts_by_year': [{'year': 2024, 'cited_by_count': 1}, {'year': 2023, 'cited_by_count': 3}, {'year': 2022, 'cited_by_count': 4}, {'year': 2021, 'cited_by_count': 5}, {'year': 2020, 'cited_by_count': 6}, {'year': 2019, 'cited_by_count': 8}, {'year': 2018, 'cited_by_count': 2}, {'year': 2017, 'cited_by_count': 6}, {'year': 2016, 'cited_by_count': 3}, {'year': 2015, 'cited_by_count': 10}, {'year': 2014, 'cited_by_count': 9}, {'year': 2013, 'cited_by_count': 4}, {'year': 2012, 'cited_by_count': 7}], 'updated_date': '2024-12-16T20:37:17.524624', 'created_date': '2016-06-24'}