{"id":"https://openalex.org/W2125182537","doi":"https://doi.org/10.1137/0220066","title":"An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph","display_name":"An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph","publication_year":1991,"publication_date":"1991-12-01","ids":{"openalex":"https://openalex.org/W2125182537","doi":"https://doi.org/10.1137/0220066","mag":"2125182537"},"language":"en","primary_location":{"id":"doi:10.1137/0220066","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220066","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5004702242","display_name":"Hillel Gazit","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hillel Gazit","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004702242"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7748,"has_fulltext":false,"cited_by_count":107,"citation_normalized_percentile":{"value":0.93590422,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"20","issue":"6","first_page":"1046","last_page":"1067"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.998199999332428,"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/combinatorics","display_name":"Combinatorics","score":0.6861745715141296},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.656277596950531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.592186689376831},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5635358095169067},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5567476749420166},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5416846871376038},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4590308964252472},{"id":"https://openalex.org/keywords/freivalds-algorithm","display_name":"Freivalds' algorithm","score":0.43882042169570923},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4291197955608368},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4167852997779846},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35106247663497925}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6861745715141296},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.656277596950531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.592186689376831},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5635358095169067},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5567476749420166},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5416846871376038},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4590308964252472},{"id":"https://openalex.org/C38506071","wikidata":"https://www.wikidata.org/wiki/Q6522941","display_name":"Freivalds' algorithm","level":5,"score":0.43882042169570923},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4291197955608368},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4167852997779846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35106247663497925},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220066","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220066","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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":6,"referenced_works":["https://openalex.org/W1586466644","https://openalex.org/W1859417806","https://openalex.org/W1995040285","https://openalex.org/W2004350101","https://openalex.org/W2086825382","https://openalex.org/W4213327355"],"related_works":["https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W1508924483","https://openalex.org/W2407321536","https://openalex.org/W4299725383","https://openalex.org/W2565865680","https://openalex.org/W2053924317","https://openalex.org/W2952147765","https://openalex.org/W2007715402","https://openalex.org/W2061532023"],"abstract_inverted_index":{"A":[0],"parallel":[1],"randomized":[2],"algorithm":[3,16,52,73],"for":[4],"finding":[5],"the":[6,40,47,56,59,69,81],"connected":[7],"components":[8],"of":[9,22,42,49,68],"an":[10,18],"undirected":[11],"graph":[12],"is":[13,39,46,53,64,80,86],"presented.":[14],"The":[15,51,72],"has":[17],"expected":[19],"running":[20],"time":[21],"$T":[23],"=":[24,29],"O(\\log":[25],"(n))$":[26,35],"with":[27],"$P":[28,61],"O((m":[30],"+":[31,76],"n)":[32],"/":[33],"\\log":[34],"processors,":[36],"where":[37],"m":[38],"number":[41,48],"edges":[43],"and":[44],"n":[45],"vertices.":[50],"optimal":[54,87],"in":[55,88],"sense":[57],"that":[58],"product":[60],"\\cdot":[62],"T$":[63],"a":[65],"linear":[66],"function":[67],"input":[70,82],"size.":[71],"requires":[74],"$O(m":[75],"n)$":[77],"space,":[78],"which":[79],"size,":[83],"so":[84],"it":[85],"space":[89],"as":[90],"well.":[91]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}