{"id":"https://openalex.org/W1569498258","doi":"https://doi.org/10.1090/dimacs/030/03","title":"Connected components algorithms for mesh-connected parallel computers","display_name":"Connected components algorithms for mesh-connected parallel computers","publication_year":1997,"publication_date":"1997-02-04","ids":{"openalex":"https://openalex.org/W1569498258","doi":"https://doi.org/10.1090/dimacs/030/03","mag":"1569498258"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/030/03","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/030/03","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5082428777","display_name":"Stephen M. Goddard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephen Goddard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060333878","display_name":"S. Kumar","orcid":"https://orcid.org/0000-0001-5456-2699"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S Kumar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011567934","display_name":"Jan F. Prins","orcid":"https://orcid.org/0000-0003-0853-6099"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Prins","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9739,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.75607519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9951000213623047,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7267169952392578},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5329863429069519},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3477531671524048}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7267169952392578},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5329863429069519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3477531671524048}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/030/03","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/030/03","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.5994","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.5994","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unl.edu/~goddard/Papers/dimacs.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.1815","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.1815","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unc.edu/~prins/Publications/paralgs97.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"We":[0,79,158],"present":[1,80],"a":[2,12,55,87,132],"new":[3],"CREW":[4,62],"PRAM":[5],"algorithm":[6,41],"for":[7,164],"finding":[8],"connected":[9],"components.":[10],"For":[11],"graph":[13],"G":[14],"with":[15],"n":[16],"vertices":[17],"and":[18,29,71,90,96,139,144],"m":[19],"edges,":[20],"algorithmA":[21],"0":[22,85],"requires":[23],"at":[24],"most":[25],"O(logn)":[26,142],"parallel":[27,69],"steps":[28],"performs":[30,113,141],"O((n+m)":[31],"log":[32,115],"n)work":[33],"in":[34,45,60],"the":[35,46,76,81,111,136,149],"worst":[36],"case.":[37],"The":[38,126],"advantage":[39],"our":[40],"has":[42],"over":[43],"others":[44],"literature":[47],"is":[48],"that":[49],"it":[50,118],"can":[51],"be":[52],"adapted":[53],"to":[54,86,109,151],"2-D":[56],"mesh-connected":[57,88],"communication":[58],"model":[59],"whichall":[61],"operations":[63,73,146],"are":[64],"replaced":[65],"by":[66],"O(log":[67],"n)":[68],"row":[70,143],"column":[72,145],"without":[74],"increasing":[75],"time":[77],"complexity.":[78],"mapping":[82],"of":[83,135],"A":[84,94,97,101,129],"computer":[89],"describe":[91],"two":[92],"implementations,":[93],"1":[95,102],"2":[98,130],".":[99],"Algorithm":[100],",":[103],"which":[104],"uses":[105],"an":[106],"adjacency":[107,137],"matrix":[108,138],"represent":[110],"graph,":[112],"O(n\u00b2":[114],"n)work.":[116],"Hence,":[117],"only":[119],"achieves":[120],"work":[121,150],"efficiency":[122],"on":[123,155],"dense":[124],"graphs.":[125,157],"second":[127],"implementation,":[128],",uses":[131],"sparse":[133],"representation":[134],"again":[140],"but":[147],"reduces":[148],"O((m":[152],"+":[153],"n)logn)":[154],"all":[156],"report":[159],"MasPar":[160],"MP-1":[161],"performance":[162],"figures":[163],"imp...":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":21},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}