{"id":"https://openalex.org/W4389469802","doi":"https://doi.org/10.48550/arxiv.2312.02332","title":"Connected Components in Linear Work and Near-Optimal Time","display_name":"Connected Components in Linear Work and Near-Optimal Time","publication_year":2023,"publication_date":"2023-12-04","ids":{"openalex":"https://openalex.org/W4389469802","doi":"https://doi.org/10.48550/arxiv.2312.02332"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2312.02332","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2312.02332","pdf_url":"https://arxiv.org/pdf/2312.02332","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2312.02332","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001992185","display_name":"Alireza Farhadi","orcid":"https://orcid.org/0000-0001-7311-0567"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Farhadi, Alireza","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067329945","display_name":"S. Cliff Liu","orcid":"https://orcid.org/0000-0003-2776-2120"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, S. Cliff","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089202539","display_name":"Elaine Shi","orcid":"https://orcid.org/0000-0002-5605-1048"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shi, Elaine","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001992185"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9980000257492065,"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.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9959999918937683,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9925000071525574,"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/binary-logarithm","display_name":"Binary logarithm","score":0.7473425269126892},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.7123232483863831},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6911226511001587},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6898792386054993},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6870604157447815},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.6283916234970093},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6270524263381958},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5207726359367371},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5099047422409058},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.508560061454773},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.45783355832099915},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4503100514411926},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.44741690158843994},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43794792890548706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42914247512817383},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3959760069847107},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2797114849090576},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11744385957717896}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7473425269126892},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.7123232483863831},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6911226511001587},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6898792386054993},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6870604157447815},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.6283916234970093},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6270524263381958},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5207726359367371},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5099047422409058},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.508560061454773},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.45783355832099915},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4503100514411926},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.44741690158843994},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43794792890548706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42914247512817383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3959760069847107},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2797114849090576},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11744385957717896},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2312.02332","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2312.02332","pdf_url":"https://arxiv.org/pdf/2312.02332","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2312.02332","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2312.02332","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2312.02332","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2312.02332","pdf_url":"https://arxiv.org/pdf/2312.02332","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8645061744","display_name":null,"funder_award_id":"2044679","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4389469802.pdf","grobid_xml":"https://content.openalex.org/works/W4389469802.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W4389469802","https://openalex.org/W4308615710","https://openalex.org/W4316652356","https://openalex.org/W4287027197","https://openalex.org/W2763569140"],"abstract_inverted_index":{"Computing":[0],"the":[1,40,73,84,91,158,167,181,211],"connected":[2,26,59,126,164,194],"components":[3,27,60,127,195],"of":[4,50,162,190,214,220],"a":[5,8,47,129,186,197,218],"graph":[6,13],"is":[7,21,109,157],"fundamental":[9],"problem":[10],"in":[11,18,28,39,64,72,90,131,166],"algorithmic":[12],"theory.":[14],"A":[15],"major":[16],"question":[17],"this":[19,112],"area":[20],"whether":[22],"we":[23,114,123,184],"can":[24,61,87,124],"compute":[25,125],"$o(\\log":[29],"n)$":[30,70,149],"parallel":[31,133,150],"time.":[32],"Recent":[33],"works":[34],"showed":[35,57,82],"an":[36],"affirmative":[37],"answer":[38],"Massively":[41],"Parallel":[42],"Computation":[43],"(MPC)":[44],"model":[45,94],"for":[46,117,192],"wide":[48],"class":[49],"graphs.":[51],"Specifically,":[52,141],"Behnezhad":[53],"et":[54,79],"al.":[55,80],"(FOCS'19)":[56],"that":[58,83,116,119],"be":[62,88],"computed":[63],"$O(\\log":[65],"d":[66,102],"+":[67,103,146],"\\log":[68,69,104,105,147,148],"rounds":[71],"MPC":[74],"model.":[75],"More":[76],"recently,":[77],"Liu":[78],"(SPAA'20)":[81],"same":[85],"result":[86,97],"achieved":[89],"standard":[92],"PRAM":[93,130,198],"but":[95],"their":[96],"incurs":[98],"$\u0398((m+n)":[99],"\\cdot":[100],"(\\log":[101],"n))$":[106],"work":[107],"which":[108],"sub-optimal.":[110],"In":[111],"paper,":[113],"show":[115],"graphs":[118],"contain":[120],"\\emph{well-connected}":[121],"components,":[122],"on":[128,176,180,196],"sub-logarithmic":[132],"time":[134,151,187,213],"with":[135,152,199],"\\emph{optimal},":[136],"i.e.,":[137],"$O(m+n)$":[138,200],"total":[139,201],"work.":[140],"our":[142,215],"algorithm":[143,171,216],"achieves":[144],"$O(\\log(1/\u03bb)":[145],"high":[153],"probability,":[154],"where":[155],"$\u03bb$":[156],"minimum":[159],"spectral":[160],"gap":[161],"any":[163],"component":[165],"input":[168],"graph.":[169],"The":[170],"requires":[172],"no":[173],"prior":[174],"knowledge":[175],"$\u03bb$.":[177,221],"Additionally,":[178],"based":[179],"\\textsc{2-Cycle}":[182],"Conjecture":[183],"provide":[185],"lower":[188],"bound":[189],"$\u03a9(\\log(1/\u03bb))$":[191],"solving":[193],"memory":[202],"when":[203],"$\u03bb\\le":[204],"(1/\\log":[205],"n)^c$,":[206],"giving":[207],"conditional":[208],"optimality":[209],"to":[210],"running":[212],"as":[217],"parameter":[219]},"counts_by_year":[],"updated_date":"2026-05-01T08:36:08.643496","created_date":"2025-10-10T00:00:00"}