{"id":"https://openalex.org/W4406458516","doi":"https://doi.org/10.1109/bigdata62323.2024.10825675","title":"Fast Distributed Memory Parallel Algorithms for Finding Connected Components in Large Graphs","display_name":"Fast Distributed Memory Parallel Algorithms for Finding Connected Components in Large Graphs","publication_year":2024,"publication_date":"2024-12-15","ids":{"openalex":"https://openalex.org/W4406458516","doi":"https://doi.org/10.1109/bigdata62323.2024.10825675"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata62323.2024.10825675","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata62323.2024.10825675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Big Data (BigData)","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/A5104069467","display_name":"Maleq Khan","orcid":null},"institutions":[{"id":"https://openalex.org/I181414168","display_name":"Texas A&M University \u2013 Kingsville","ror":"https://ror.org/05abs3w97","country_code":"US","type":"education","lineage":["https://openalex.org/I181414168"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Maleq Khan","raw_affiliation_strings":["Texas A&M University-Kingsville,Department of Electrical Engineering and Computer Science"],"affiliations":[{"raw_affiliation_string":"Texas A&M University-Kingsville,Department of Electrical Engineering and Computer Science","institution_ids":["https://openalex.org/I181414168"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113347956","display_name":"S Boddu","orcid":null},"institutions":[{"id":"https://openalex.org/I181414168","display_name":"Texas A&M University \u2013 Kingsville","ror":"https://ror.org/05abs3w97","country_code":"US","type":"education","lineage":["https://openalex.org/I181414168"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sharon Boddu","raw_affiliation_strings":["Texas A&M University-Kingsville,Department of Electrical Engineering and Computer Science"],"affiliations":[{"raw_affiliation_string":"Texas A&M University-Kingsville,Department of Electrical Engineering and Computer Science","institution_ids":["https://openalex.org/I181414168"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104069467"],"corresponding_institution_ids":["https://openalex.org/I181414168"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26620587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"579","last_page":"588"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9986000061035156,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9926999807357788,"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.7899752855300903},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.641909122467041},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.4891507923603058},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4464511275291443},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4272870421409607},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38714465498924255},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.334026575088501}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7899752855300903},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.641909122467041},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.4891507923603058},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4464511275291443},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4272870421409607},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38714465498924255},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.334026575088501}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata62323.2024.10825675","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata62323.2024.10825675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Big Data (BigData)","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":31,"referenced_works":["https://openalex.org/W109781734","https://openalex.org/W1656132379","https://openalex.org/W1990595082","https://openalex.org/W1993297915","https://openalex.org/W2004350101","https://openalex.org/W2013081353","https://openalex.org/W2017102965","https://openalex.org/W2028583484","https://openalex.org/W2035080386","https://openalex.org/W2047345171","https://openalex.org/W2120925698","https://openalex.org/W2132202037","https://openalex.org/W2135496605","https://openalex.org/W2153624566","https://openalex.org/W2158908968","https://openalex.org/W2161723275","https://openalex.org/W2294347342","https://openalex.org/W2469279958","https://openalex.org/W2480409449","https://openalex.org/W2590926957","https://openalex.org/W2616431611","https://openalex.org/W2971745895","https://openalex.org/W3027718472","https://openalex.org/W3152422817","https://openalex.org/W3204075099","https://openalex.org/W4230422651","https://openalex.org/W4249333804","https://openalex.org/W4286432902","https://openalex.org/W4307366331","https://openalex.org/W6602249741","https://openalex.org/W6608022175"],"related_works":["https://openalex.org/W2026512611","https://openalex.org/W1985165680","https://openalex.org/W4245497162","https://openalex.org/W2027852278","https://openalex.org/W2070983336","https://openalex.org/W1837558792","https://openalex.org/W4212854884","https://openalex.org/W2363502211","https://openalex.org/W1982466989","https://openalex.org/W2995170196"],"abstract_inverted_index":{"Finding":[0],"the":[1,40,68,74,81,88,97,142,167,192,201],"connected":[2,18,46,75],"components":[3,47],"in":[4,11,20,39,111],"a":[5,8,21,24,33,43,54,100,108,121,155,175,208,218],"graph":[6,12,22],"is":[7,23,32,107,161],"fundamental":[9],"problem":[10,77],"theory":[13],"and":[14,84,93,96,137,163,213],"network":[15,104],"science.":[16],"A":[17],"component":[19,76],"maximal":[25],"set":[26],"of":[27,90,99,123,148,211,221],"vertices":[28,38],"such":[29],"that":[30,197],"there":[31,106],"path":[34],"between":[35],"any":[36],"two":[37],"component.":[41],"In":[42,118,150,181],"serial":[44],"setting,":[45],"can":[48],"be":[49],"efficiently":[50],"computed":[51],"by":[52],"running":[53],"breadth-first":[55],"search":[56],"(BFS).":[57],"However,":[58],"BFS-based":[59],"algorithms":[60,72,114,126,131,199,205],"do":[61],"not":[62],"lead":[63],"to":[64,188,217],"good":[65],"parallelization.":[66],"At":[67],"early":[69],"stage,":[70],"parallel":[71,113,125,177],"for":[73,80,115],"were":[78],"developed":[79],"PRAM":[82,139,156],"model":[83],"shared-memory":[85],"systems.":[86],"With":[87],"availability":[89],"big":[91,94],"data":[92],"graphs":[95],"development":[98],"new":[101],"area":[102],"called":[103,141,158,179],"science,":[105],"renewed":[109],"interest":[110],"developing":[112],"this":[116,151],"problem.":[117],"recent":[119,202],"years,":[120],"number":[122,220],"distributed-memory":[124,176,204],"have":[127],"been":[128],"developed.":[129],"These":[130],"are":[132],"based":[133],"on":[134,171,207],"mainly":[135],"Shiloach":[136],"Vishkin\u2019s":[138],"algorithm,":[140,144,157,178],"SV":[143,168],"or":[145],"some":[146,185],"variants":[147],"SV.":[149],"paper,":[152],"we":[153,173,183],"present":[154],"SELP,":[159,172],"which":[160],"elegant":[162],"significantly":[164,206],"simpler":[165],"than":[166],"algorithm.":[169],"Based":[170],"develop":[174],"DSELP.":[180],"addition,":[182],"incorporate":[184],"novel":[186],"techniques":[187],"minimize":[189],"communications":[190],"among":[191],"processors.":[193,222],"Experimental":[194],"results":[195],"show":[196],"our":[198],"outperform":[200],"state-of-the-art":[203],"wide":[209],"variety":[210],"graphs,":[212],"scale":[214],"very":[215],"well":[216],"large":[219]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}