{"id":"https://openalex.org/W2042010354","doi":"https://doi.org/10.1145/1378533.1378560","title":"Finding strongly connected components in parallel using <i>O</i> (log <sup>2</sup> <i>n</i> ) reachability queries","display_name":"Finding strongly connected components in parallel using <i>O</i> (log <sup>2</sup> <i>n</i> ) reachability queries","publication_year":2008,"publication_date":"2008-06-14","ids":{"openalex":"https://openalex.org/W2042010354","doi":"https://doi.org/10.1145/1378533.1378560","mag":"2042010354"},"language":"en","primary_location":{"id":"doi:10.1145/1378533.1378560","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","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/A5079220724","display_name":"Warren Schudy","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Warren Schudy","raw_affiliation_strings":["Brown University, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079220724"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":0.8011,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.74598499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"146","last_page":"151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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.9940999746322632,"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/reachability","display_name":"Reachability","score":0.8615410327911377},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6972023248672485},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6756312847137451},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.6402258276939392},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.603786289691925},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.5098230242729187},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48677870631217957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4771418273448944},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4684574604034424},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43306082487106323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42474353313446045}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8615410327911377},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6972023248672485},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6756312847137451},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.6402258276939392},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.603786289691925},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.5098230242729187},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48677870631217957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4771418273448944},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4684574604034424},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43306082487106323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42474353313446045},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1378533.1378560","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W24440951","https://openalex.org/W1584086289","https://openalex.org/W1595409123","https://openalex.org/W1945186739","https://openalex.org/W1965996575","https://openalex.org/W1986816824","https://openalex.org/W1998292573","https://openalex.org/W2001383125","https://openalex.org/W2020283440","https://openalex.org/W2020944181","https://openalex.org/W2023518480","https://openalex.org/W2039972044","https://openalex.org/W2057312772","https://openalex.org/W2067183561","https://openalex.org/W2075862701","https://openalex.org/W2080063509","https://openalex.org/W2082801772","https://openalex.org/W2085467310","https://openalex.org/W2088570605","https://openalex.org/W2097884397","https://openalex.org/W2118382442","https://openalex.org/W2120250211","https://openalex.org/W2132750992","https://openalex.org/W2899702797","https://openalex.org/W4290864872"],"related_works":["https://openalex.org/W2033567934","https://openalex.org/W2782194400","https://openalex.org/W2365236566","https://openalex.org/W4206573252","https://openalex.org/W2023776467","https://openalex.org/W938372727","https://openalex.org/W2011214451","https://openalex.org/W2230758337","https://openalex.org/W4212827260","https://openalex.org/W1548208024"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,13,35,45,51],"randomized":[3],"(Las-Vegas)":[4],"parallel":[5,28],"algorithm":[6,55],"for":[7],"computing":[8],"strongly":[9,60],"connected":[10,61],"components":[11],"of":[12,41,44,48],"graph":[14],"with":[15],"n":[16],"vertices":[17,49],"and":[18],"m":[19],"edges.":[20],"The":[21],"runtime":[22],"is":[23],"dominated":[24],"by":[25],"O(log2n)":[26,32],"multi-source":[27],"reachability":[29],"queries;":[30],"i.e.":[31],"calls":[33],"to":[34],"subroutine":[36],"that":[37],"computes":[38],"the":[39,42,59],"union":[40],"descendants":[43],"given":[46,52],"set":[47],"in":[50],"digraph.":[53],"Our":[54],"also":[56],"topologically":[57],"sorts":[58],"components.":[62]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}