{"id":"https://openalex.org/W2036440386","doi":"https://doi.org/10.1080/00207160008804971","title":"Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>\u2217</sup>","display_name":"Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>\u2217</sup>","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2036440386","doi":"https://doi.org/10.1080/00207160008804971","mag":"2036440386"},"language":"en","primary_location":{"id":"doi:10.1080/00207160008804971","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804971","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5111910378","display_name":"Hon Shen","orcid":null},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Hon Shen","raw_affiliation_strings":["School of Computing and Information Technology , Griffith University , Nathan, QLD, 4111, Australia","School of Computing & Information Technology, Griffith University, Nathan, Qld. 4111, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computing and Information Technology , Griffith University , Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]},{"raw_affiliation_string":"School of Computing & Information Technology, Griffith University, Nathan, Qld. 4111, Australia#TAB#","institution_ids":["https://openalex.org/I11701301"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111910378"],"corresponding_institution_ids":["https://openalex.org/I11701301"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15317559,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"75","issue":"2","first_page":"129","last_page":"136"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7473347783088684},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6592755317687988},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6216622591018677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5825949311256409},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5294308662414551},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5180292725563049},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5163336992263794},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5162258148193359},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4889441728591919},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.46219000220298767},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45862358808517456},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43158233165740967},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4285274147987366},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4200124144554138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3809238076210022},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07704737782478333}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7473347783088684},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6592755317687988},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6216622591018677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5825949311256409},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5294308662414551},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5180292725563049},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5163336992263794},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5162258148193359},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4889441728591919},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.46219000220298767},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45862358808517456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43158233165740967},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4285274147987366},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4200124144554138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3809238076210022},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07704737782478333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160008804971","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804971","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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":13,"referenced_works":["https://openalex.org/W1606654265","https://openalex.org/W2009072875","https://openalex.org/W2023658462","https://openalex.org/W2034581303","https://openalex.org/W2046946959","https://openalex.org/W2048500523","https://openalex.org/W2063501657","https://openalex.org/W2069416867","https://openalex.org/W2081385108","https://openalex.org/W2120490947","https://openalex.org/W2130566259","https://openalex.org/W2156372444","https://openalex.org/W4241977206"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2376814941","https://openalex.org/W2562218965","https://openalex.org/W2138987445","https://openalex.org/W3081212354","https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W2109692093","https://openalex.org/W2069416867","https://openalex.org/W4387560073"],"abstract_inverted_index":{"Let":[0],"Gbe":[1],"a":[2,47,64],"connected,":[3],"undirected":[4],"and":[5,10,67,84,92,95,102,106],"weighted":[6],"graph":[7],"with":[8],"nvertices":[9],"medges.":[11],"A":[12],"most":[13,54],"vital":[14,55],"edge":[15,25,56],"of":[16,40,57,82,93],"Gwith":[17],"respect":[18],"to":[19],"minimum":[20,37],"spanning":[21,38],"tree":[22,39],"is":[23],"an":[24,72],"whose":[26],"removal":[27],"from":[28],"G":[29,58],"results":[30,81],"in":[31,35,59],"the":[32,36,41,53,79,88,98,111],"greatest":[33],"weight-increase":[34],"remaining":[42],"graph.":[43],"This":[44],"paper":[45],"presents":[46],"fast":[48],"parallel":[49],"algorithm":[50],"that":[51],"computes":[52],"time":[60,68,83,94,103,107],"using":[61,69,104,108],"processors":[62,70,86,96,105,109],"on":[63,71,87,97,110],"CRCW":[65,89],"PRAM":[66,74,90,100],"EREW":[73,112],"respectively.":[75],"It":[76],"significantly":[77],"improves":[78],"known":[80],"O(m)":[85],"[10,13],":[91],"CREW":[99],"[13],":[101],"PRAM,":[113],"respectivel.":[114]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}