{"id":"https://openalex.org/W2916441467","doi":"https://doi.org/10.1109/cahpc.2018.8645917","title":"A New Efficient Parallel Algorithm for Minimum Spanning Tree","display_name":"A New Efficient Parallel Algorithm for Minimum Spanning Tree","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2916441467","doi":"https://doi.org/10.1109/cahpc.2018.8645917","mag":"2916441467"},"language":"en","primary_location":{"id":"doi:10.1109/cahpc.2018.8645917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cahpc.2018.8645917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","raw_type":"proceedings-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/A5048594041","display_name":"Jucele Vasconcellos","orcid":"https://orcid.org/0000-0003-3369-1533"},"institutions":[{"id":"https://openalex.org/I122558511","display_name":"Universidade Federal de Mato Grosso do Sul","ror":"https://ror.org/0366d2847","country_code":"BR","type":"education","lineage":["https://openalex.org/I122558511"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Jucele Franca de Alencar Vasconcellos","raw_affiliation_strings":["College of Computing, Federal University of Mato Grosso do Sul, Campo Grande, MS, Brazil"],"affiliations":[{"raw_affiliation_string":"College of Computing, Federal University of Mato Grosso do Sul, Campo Grande, MS, Brazil","institution_ids":["https://openalex.org/I122558511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028026699","display_name":"Edson N. C\u00e1ceres","orcid":"https://orcid.org/0000-0001-6471-3462"},"institutions":[{"id":"https://openalex.org/I122558511","display_name":"Universidade Federal de Mato Grosso do Sul","ror":"https://ror.org/0366d2847","country_code":"BR","type":"education","lineage":["https://openalex.org/I122558511"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Edson Norberto Caceres","raw_affiliation_strings":["College of Computing, Federal University of Mato Grosso do Sul, Campo Grande, MS, Brazil"],"affiliations":[{"raw_affiliation_string":"College of Computing, Federal University of Mato Grosso do Sul, Campo Grande, MS, Brazil","institution_ids":["https://openalex.org/I122558511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065078722","display_name":"Henrique Mongelli","orcid":"https://orcid.org/0000-0002-0377-3717"},"institutions":[{"id":"https://openalex.org/I122558511","display_name":"Universidade Federal de Mato Grosso do Sul","ror":"https://ror.org/0366d2847","country_code":"BR","type":"education","lineage":["https://openalex.org/I122558511"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Henrique Mongelli","raw_affiliation_strings":["College of Computing, Federal University of Mato Grosso do Sul, Campo Grande, MS, Brazil"],"affiliations":[{"raw_affiliation_string":"College of Computing, Federal University of Mato Grosso do Sul, Campo Grande, MS, Brazil","institution_ids":["https://openalex.org/I122558511"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113757410","display_name":"Siang Wun Song","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Siang Wun Song","raw_affiliation_strings":["Institute of Mathematics and Statistics, University of s\u00e3o Paulo, s\u00e3o Paulo, Sp, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Statistics, University of s\u00e3o Paulo, s\u00e3o Paulo, Sp, Brazil","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048594041"],"corresponding_institution_ids":["https://openalex.org/I122558511"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.19266724,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"107","last_page":"114"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7771838903427124},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6485593914985657},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6387263536453247},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6194465160369873},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5967565178871155},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5328569412231445},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.46912240982055664},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46630775928497314},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4640260338783264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4519897401332855},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44189855456352234},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38863298296928406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15464887022972107},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07179710268974304}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7771838903427124},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6485593914985657},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6387263536453247},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6194465160369873},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5967565178871155},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5328569412231445},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.46912240982055664},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46630775928497314},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4640260338783264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4519897401332855},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44189855456352234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38863298296928406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15464887022972107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07179710268974304},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cahpc.2018.8645917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cahpc.2018.8645917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1968523623","https://openalex.org/W1974165977","https://openalex.org/W2007000019","https://openalex.org/W2012042319","https://openalex.org/W2039997255","https://openalex.org/W2045271686","https://openalex.org/W2050866845","https://openalex.org/W2069446854","https://openalex.org/W2086825382","https://openalex.org/W2097426481","https://openalex.org/W2111667217","https://openalex.org/W2121653690","https://openalex.org/W2138304862","https://openalex.org/W2159109004","https://openalex.org/W2541327307","https://openalex.org/W2754073485","https://openalex.org/W2768702544","https://openalex.org/W3162536823","https://openalex.org/W4251441228"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"In":[0,54,102],"this":[1,30,103],"paper,":[2,104],"using":[3,84],"the":[4,35,38,60,74,91,118,121,125,131,139],"BSP/CGM":[5],"model,":[6],"we":[7,68,105],"propose":[8],"a":[9,16,20,25,55,64,70,79],"parallel":[10,71],"algorithm":[11,72,114,141],"and":[12,98,124,136],"implement":[13],"it":[14],"on":[15,34,59,90,151],"GPGPU":[17],"to":[18,77],"obtain":[19,78],"minimum":[21,80],"spanning":[22,81],"tree":[23,82],"of":[24,37,62,93,120,138],"graph.":[26],"Previous":[27],"works":[28],"for":[29],"problem":[31,41],"are":[32,142],"based":[33,58,89],"solution":[36],"list":[39,85],"ranking":[40],"which,":[42],"though":[43],"efficient":[44],"in":[45,52,109],"theory,":[46],"did":[47],"not":[48,116,129],"produce":[49],"good":[50],"speedups":[51],"practice.":[53],"later":[56],"work,":[57],"idea":[61],"computing":[63],"structure":[65],"called":[66],"strut,":[67],"proposed":[69,113,140],"under":[73],"BSP/CGP":[75],"model":[76],"without":[83],"ranking.":[86],"It":[87],"is":[88],"construction":[92,127],"an":[94,149],"auxiliary":[95],"bipartite":[96,122],"graph":[97],"uses":[99],"integer":[100],"sorting.":[101],"improve":[106],"that":[107],"work":[108],"some":[110],"aspects.":[111],"The":[112,134],"does":[115,128],"require":[117,130],"computation":[119],"graph,":[123],"strut":[126],"sorting":[132],"algorithm.":[133],"efficiency":[135],"scalability":[137],"verified":[143],"through":[144],"experimental":[145],"results":[146],"obtained":[147],"by":[148],"implementation":[150],"GPGPU.":[152]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}