Publication Information

{'id': 'https://openalex.org/W2122848400', 'doi': 'https://doi.org/10.1109/icict.2007.375336', 'title': 'An Algorithm for Finding Minimum Degree Spanning Tree of Series-Parallel Graphs', 'display_name': 'An Algorithm for Finding Minimum Degree Spanning Tree of Series-Parallel Graphs', 'publication_year': 2007, 'publication_date': '2007-03-01', 'ids': {'openalex': 'https://openalex.org/W2122848400', 'doi': 'https://doi.org/10.1109/icict.2007.375336', 'mag': '2122848400'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/icict.2007.375336', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306419544', 'display_name': 'International Conference on Information and Communication Technology', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'conference'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'proceedings-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/A5109225366', 'display_name': 'Mohammad Atiqul Haque', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I183697816', 'display_name': 'Bangladesh University of Engineering and Technology', 'ror': 'https://ror.org/05a1qpv97', 'country_code': 'BD', 'type': 'education', 'lineage': ['https://openalex.org/I183697816']}], 'countries': ['BD'], 'is_corresponding': False, 'raw_author_name': 'Mohammad Atiqul Haque', 'raw_affiliation_strings': ['Bangladesh Univ. of Eng. & Technol., Dhaka#TAB#'], 'affiliations': [{'raw_affiliation_string': 'Bangladesh Univ. of Eng. & Technol., Dhaka#TAB#', 'institution_ids': ['https://openalex.org/I183697816']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5013204293', 'display_name': 'Md. Reaz Uddin', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I183697816', 'display_name': 'Bangladesh University of Engineering and Technology', 'ror': 'https://ror.org/05a1qpv97', 'country_code': 'BD', 'type': 'education', 'lineage': ['https://openalex.org/I183697816']}], 'countries': ['BD'], 'is_corresponding': False, 'raw_author_name': 'Md. Reaz Uddin', 'raw_affiliation_strings': ['Bangladesh Univ. of Eng. & Technol., Dhaka#TAB#'], 'affiliations': [{'raw_affiliation_string': 'Bangladesh Univ. of Eng. & Technol., Dhaka#TAB#', 'institution_ids': ['https://openalex.org/I183697816']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5101757867', 'display_name': 'Md. Abul Kashem', 'orcid': 'https://orcid.org/0000-0001-7762-9681'}, 'institutions': [{'id': 'https://openalex.org/I183697816', 'display_name': 'Bangladesh University of Engineering and Technology', 'ror': 'https://ror.org/05a1qpv97', 'country_code': 'BD', 'type': 'education', 'lineage': ['https://openalex.org/I183697816']}], 'countries': ['BD'], 'is_corresponding': False, 'raw_author_name': 'Md. Abul Kashem', 'raw_affiliation_strings': ['Institute of Information and Communication Technology, Bangladesh University of Engineering and Technology, Dhaka 1000, Bangladesh, [email protected]'], 'affiliations': [{'raw_affiliation_string': 'Institute of Information and Communication Technology, Bangladesh University of Engineering and Technology, Dhaka 1000, Bangladesh, [email protected]', 'institution_ids': ['https://openalex.org/I183697816']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': True, 'fulltext_origin': 'ngrams', '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': 63}, 'biblio': {'volume': None, 'issue': None, 'first_page': '27', 'last_page': '31'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10374', 'display_name': 'Advanced Graph Theory Research', 'score': 0.9991, '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': 'Advanced Graph Theory Research', 'score': 0.9991, '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/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9988, '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/T12288', 'display_name': 'Optimization and Search Problems', 'score': 0.9968, '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/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.68812096}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.5596466}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.5161963}, {'id': 'https://openalex.org/keywords/degree', 'display_name': 'Degree (music)', 'score': 0.47759748}, {'id': 'https://openalex.org/keywords/trémaux-tree', 'display_name': 'Trémaux tree', 'score': 0.47027093}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.46767932}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8713021}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8121449}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.6924188}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.68812096}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.5650798}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.5596466}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.5196808}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.5161963}, {'id': 'https://openalex.org/C23394520', 'wikidata': 'https://www.wikidata.org/wiki/Q4919350', 'display_name': 'Shortest-path tree', 'level': 3, 'score': 0.50223684}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.49951982}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.4818431}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.47759748}, {'id': 'https://openalex.org/C124302570', 'wikidata': 'https://www.wikidata.org/wiki/Q7849146', 'display_name': 'Trémaux tree', 'level': 5, 'score': 0.47027093}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.46767932}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.41769427}, {'id': 'https://openalex.org/C311688', 'wikidata': 'https://www.wikidata.org/wiki/Q2393193', 'display_name': 'Time complexity', 'level': 2, 'score': 0.41519222}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.39053056}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.33301735}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.32761285}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.32387483}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.18189201}, {'id': 'https://openalex.org/C43517604', 'wikidata': 'https://www.wikidata.org/wiki/Q7144893', 'display_name': 'Pathwidth', 'level': 4, 'score': 0.1653296}, {'id': 'https://openalex.org/C203776342', 'wikidata': 'https://www.wikidata.org/wiki/Q1378376', 'display_name': 'Line graph', 'level': 3, 'score': 0.13270071}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.116960645}, {'id': 'https://openalex.org/C121332964', 'wikidata': 'https://www.wikidata.org/wiki/Q413', 'display_name': 'Physics', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C24890656', 'wikidata': 'https://www.wikidata.org/wiki/Q82811', 'display_name': 'Acoustics', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/icict.2007.375336', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306419544', 'display_name': 'International Conference on Information and Communication Technology', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'conference'}, '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': 9, 'referenced_works': ['https://openalex.org/W1557803614', 'https://openalex.org/W1968569027', 'https://openalex.org/W1985996385', 'https://openalex.org/W2003021478', 'https://openalex.org/W2017127755', 'https://openalex.org/W2032004078', 'https://openalex.org/W2066700938', 'https://openalex.org/W2074417667', 'https://openalex.org/W2110559866'], 'related_works': ['https://openalex.org/W4380840098', 'https://openalex.org/W3081212354', 'https://openalex.org/W2943635264', 'https://openalex.org/W2518240130', 'https://openalex.org/W2384589661', 'https://openalex.org/W2281826919', 'https://openalex.org/W2130375301', 'https://openalex.org/W2122848400', 'https://openalex.org/W1973100174', 'https://openalex.org/W1593284275'], 'abstract_inverted_index': {'A': [0], 'minimum': [1, 19, 27, 84], 'degree': [2, 17, 28], 'spanning': [3, 11, 22, 29, 38, 86], 'tree': [4, 12, 30, 39, 87], 'of': [5, 13, 24, 40], 'a': [6, 10, 37, 41, 48], 'graph': [7], 'G': [8, 14], 'is': [9, 18, 33], 'whose': [15], 'maximum': [16], 'among': [20], 'all': [21], 'trees': [23], 'G.': [25], 'The': [26], 'problem': [31, 55, 88], '(MDST)': [32], 'to': [34], 'construct': [35], 'such': [36], 'graph.': [42], 'In': [43], 'this': [44, 73], 'paper,': [45], 'we': [46, 75], 'propose': [47], 'polynomial-time': [49], 'algorithm': [50, 60, 80], 'for': [51, 65, 81], 'solving': [52, 82], 'the': [53, 83], 'MDST': [54], 'on': [56, 89], 'series-parallel': [57, 66, 90], 'graphs.': [58, 91], 'Our': [59], 'runs': [61], 'in': [62], 'linear': [63], 'time': [64], 'graphs': [67], 'with': [68], 'small': [69], 'degrees.': [70], 'By': [71], 'applying': [72], 'algorithm,': [74], 'also': [76], 'give': [77], 'an': [78], 'approximation': [79], 'edge-ranking': [85]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2122848400', 'counts_by_year': [], 'updated_date': '2024-12-08T10:34:14.313159', 'created_date': '2016-06-24'}