{"id":"https://openalex.org/W2034581303","doi":"https://doi.org/10.1016/0167-8191(92)90061-b","title":"Parallel algorithms for finding the most vital edge with respect to minimum spanning tree","display_name":"Parallel algorithms for finding the most vital edge with respect to minimum spanning tree","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2034581303","doi":"https://doi.org/10.1016/0167-8191(92)90061-b","mag":"2034581303"},"language":"en","primary_location":{"id":"doi:10.1016/0167-8191(92)90061-b","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8191(92)90061-b","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104039280","display_name":"Lih\u2010Hsing Hsu","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Lih-Hsing Hsu","raw_affiliation_strings":["Department of Information and Computer Science, National Chiao-Tung University, Hsinchu 30050, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Science, National Chiao-Tung University, Hsinchu 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100399553","display_name":"Pengfei Wang","orcid":"https://orcid.org/0000-0002-3061-9897"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Peng-Fei Wang","raw_affiliation_strings":["Institute of Industrial Engineering, National Tsing Hua University, Hsinchu 30043, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Industrial Engineering, National Tsing Hua University, Hsinchu 30043, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018643231","display_name":"Chu-Tao Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chu-Tao Wu","raw_affiliation_strings":["Institute of Industrial Engineering, National Tsing Hua University, Hsinchu 30043, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Industrial Engineering, National Tsing Hua University, Hsinchu 30043, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5104039280"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":{"value":2680,"currency":"USD","value_usd":2680},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.17184489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"18","issue":"10","first_page":"1143","last_page":"1155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9987999796867371,"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.9948999881744385,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9876000285148621,"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/spanning-tree","display_name":"Spanning tree","score":0.886405885219574},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8240198493003845},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7559115886688232},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6577640771865845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5992456078529358},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5929996967315674},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5428802967071533},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5261842012405396},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4853626489639282},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4715345501899719},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4600531756877899},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4503152370452881},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.44419580698013306},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4406246244907379},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4225611686706543},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.41549235582351685},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39434194564819336},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29324913024902344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25274592638015747},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0783604085445404}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.886405885219574},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8240198493003845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7559115886688232},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6577640771865845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5992456078529358},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5929996967315674},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5428802967071533},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5261842012405396},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4853626489639282},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4715345501899719},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4600531756877899},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4503152370452881},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.44419580698013306},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4406246244907379},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4225611686706543},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.41549235582351685},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39434194564819336},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29324913024902344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25274592638015747},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0783604085445404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-8191(92)90061-b","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8191(92)90061-b","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W65285716","https://openalex.org/W1964602554","https://openalex.org/W1965680834","https://openalex.org/W1977119258","https://openalex.org/W1986022261","https://openalex.org/W2009072875","https://openalex.org/W2017927472","https://openalex.org/W2055717497","https://openalex.org/W2057899414","https://openalex.org/W2062851100","https://openalex.org/W2078629151","https://openalex.org/W2109560070","https://openalex.org/W2155375914","https://openalex.org/W2158365276","https://openalex.org/W2159008239","https://openalex.org/W2169528473","https://openalex.org/W6602562317","https://openalex.org/W6641692026"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W2059360098","https://openalex.org/W4380840098","https://openalex.org/W2099915933","https://openalex.org/W3081212354","https://openalex.org/W2418231958","https://openalex.org/W2014991506","https://openalex.org/W2010585027"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}