Publication Information

{'id': 'https://openalex.org/W3191415409', 'doi': None, 'title': 'A Parallel Algorithm for the Minimum Spanning Tree', 'display_name': 'A Parallel Algorithm for the Minimum Spanning Tree', 'publication_year': 1991, 'publication_date': '1991-01-01', 'ids': {'openalex': 'https://openalex.org/W3191415409', 'mag': '3191415409'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://digitalcommons.dartmouth.edu/cgi/viewcontent.cgi?article=1063&context=cs_tr', '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/A5103328212', 'display_name': 'D. Barton Johnson', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Donald B Johnson', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5001125856', 'display_name': 'Panagiotis Metaxas', 'orcid': 'https://orcid.org/0000-0002-5539-783X'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Panagiotis Metaxas', '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': 1.457, 'has_fulltext': False, 'cited_by_count': 13, 'citation_normalized_percentile': {'value': 0.856535, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 81, 'max': 82}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T12288', 'display_name': 'Optimization and Search Problems', 'score': 0.9715, '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'}}, 'topics': [{'id': 'https://openalex.org/T12288', 'display_name': 'Optimization and Search Problems', 'score': 0.9715, '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'}}, {'id': 'https://openalex.org/T11478', 'display_name': 'Caching and Content Delivery', 'score': 0.9619, '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'}}, {'id': 'https://openalex.org/T12203', 'display_name': 'Mobile Agent-Based Network Management', 'score': 0.9548, '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/tree', 'display_name': 'Tree (set theory)', 'score': 0.43703637}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.42741865}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.6162944}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.58058286}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.5618025}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.506374}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.502979}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.43703637}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.42741865}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.42281508}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.38108057}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.33693182}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://digitalcommons.dartmouth.edu/cgi/viewcontent.cgi?article=1063&context=cs_tr', '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/W9198619', 'https://openalex.org/W40089099', 'https://openalex.org/W3202268800', 'https://openalex.org/W3151601737', 'https://openalex.org/W3119322905', 'https://openalex.org/W3111603571', 'https://openalex.org/W2931047390', 'https://openalex.org/W2796034895', 'https://openalex.org/W2795417979', 'https://openalex.org/W2795411657', 'https://openalex.org/W2789215218', 'https://openalex.org/W2624437099', 'https://openalex.org/W2418231958', 'https://openalex.org/W2403871492', 'https://openalex.org/W2381121915', 'https://openalex.org/W2355225748', 'https://openalex.org/W2315552740', 'https://openalex.org/W2099915933', 'https://openalex.org/W2052863074', 'https://openalex.org/W1496852013'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3191415409', 'counts_by_year': [{'year': 2017, 'cited_by_count': 1}, {'year': 2014, 'cited_by_count': 1}, {'year': 2012, 'cited_by_count': 1}], 'updated_date': '2024-12-16T09:41:17.259130', 'created_date': '2021-08-16'}