Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2052863074', 'doi': 'https://doi.org/10.3724/sp.j.1087.2009.01490', 'title': 'Novel connected dominating set algorithm based on minimum spanning tree', 'display_name': 'Novel connected dominating set algorithm based on minimum spanning tree', 'publication_year': 2009, 'publication_date': '2009-08-05', 'ids': {'openalex': 'https://openalex.org/W2052863074', 'doi': 'https://doi.org/10.3724/sp.j.1087.2009.01490', 'mag': '2052863074'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.3724/sp.j.1087.2009.01490', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S107449649', 'display_name': 'Journal of Computer Applications', 'issn_l': '1001-9081', 'issn': ['1001-9081'], 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310319982', 'host_organization_name': 'Science Press', 'host_organization_lineage': ['https://openalex.org/P4310319982'], 'host_organization_lineage_names': ['Science Press'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', '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/A5058460393', 'display_name': 'Wenyu Gao', 'orcid': 'https://orcid.org/0000-0002-2128-9232'}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'Wen-yu GAO', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5058460393'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 4, 'citation_normalized_percentile': {'value': 0.74764, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 77, 'max': 79}, 'biblio': {'volume': '29', 'issue': '6', 'first_page': '1490', 'last_page': '1493'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10246', 'display_name': 'Mobile Ad Hoc Networks', 'score': 0.9866, '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/T10246', 'display_name': 'Mobile Ad Hoc Networks', 'score': 0.9866, '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/T10138', 'display_name': 'Network Traffic and Congestion Control', 'score': 0.9811, '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/T12546', 'display_name': 'Smart Parking Systems Research', 'score': 0.9798, 'subfield': {'id': 'https://openalex.org/subfields/2215', 'display_name': 'Building and Construction'}, 'field': {'id': 'https://openalex.org/fields/22', 'display_name': 'Engineering'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}], 'keywords': [{'id': 'https://openalex.org/keywords/dominating-set', 'display_name': 'Dominating set', 'score': 0.50942856}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.44068834}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.4177541}], 'concepts': [{'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.84167385}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.69912183}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.6592612}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.6515731}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.62549865}, {'id': 'https://openalex.org/C146661039', 'wikidata': 'https://www.wikidata.org/wiki/Q2915204', 'display_name': 'Dominating set', 'level': 4, 'score': 0.50942856}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.44068834}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.4177541}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.37348813}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.21092007}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.20073646}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.16742355}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.08630419}, {'id': 'https://openalex.org/C80899671', 'wikidata': 'https://www.wikidata.org/wiki/Q1304193', 'display_name': 'Vertex (graph theory)', 'level': 3, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.3724/sp.j.1087.2009.01490', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S107449649', 'display_name': 'Journal of Computer Applications', 'issn_l': '1001-9081', 'issn': ['1001-9081'], 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310319982', 'host_organization_name': 'Science Press', 'host_organization_lineage': ['https://openalex.org/P4310319982'], 'host_organization_lineage_names': ['Science Press'], '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': 4, 'referenced_works': ['https://openalex.org/W109985799', 'https://openalex.org/W2077371116', 'https://openalex.org/W3141863997', 'https://openalex.org/W4245772454'], 'related_works': ['https://openalex.org/W4380840098', 'https://openalex.org/W4242086819', 'https://openalex.org/W3016811403', 'https://openalex.org/W2589768050', 'https://openalex.org/W2390742649', 'https://openalex.org/W2387385213', 'https://openalex.org/W2381121915', 'https://openalex.org/W2353025557', 'https://openalex.org/W2281826919', 'https://openalex.org/W2074214908'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2052863074', 'counts_by_year': [{'year': 2023, 'cited_by_count': 1}, {'year': 2021, 'cited_by_count': 1}, {'year': 2017, 'cited_by_count': 2}], 'updated_date': '2024-12-15T07:20:23.238140', 'created_date': '2016-06-24'}