{"id":"https://openalex.org/W3152007678","doi":"https://doi.org/10.1145/3564822","title":"Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity","display_name":"Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity","publication_year":2022,"publication_date":"2022-10-25","ids":{"openalex":"https://openalex.org/W3152007678","doi":"https://doi.org/10.1145/3564822","mag":"3152007678"},"language":"en","primary_location":{"id":"doi:10.1145/3564822","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564822","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564822","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564822","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062097969","display_name":"Max Franck","orcid":"https://orcid.org/0000-0003-3583-8033"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Max Franck","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0000-0003-3583-8033","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068060092","display_name":"Sorrachai Yingchareonthawornchai","orcid":"https://orcid.org/0000-0002-7169-0163"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]},{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI","US"],"is_corresponding":false,"raw_author_name":"Sorrachai Yingchareonthawornchai","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo, Finland","Michigan State University, East Lansing, United States"],"raw_orcid":"https://orcid.org/0000-0002-7169-0163","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]},{"raw_affiliation_string":"Michigan State University, East Lansing, United States","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00536582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9976999759674072,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9976999759674072,"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/T11478","display_name":"Caching and Content Delivery","score":0.9962000250816345,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6421141028404236},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6131028532981873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5548275709152222},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5164080262184143},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4801168441772461},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43581336736679077},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4336610436439514},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36484694480895996},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35836514830589294},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35132497549057007},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28185713291168213}],"concepts":[{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6421141028404236},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6131028532981873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5548275709152222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5164080262184143},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4801168441772461},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43581336736679077},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4336610436439514},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36484694480895996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35836514830589294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35132497549057007},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28185713291168213},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/3564822","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564822","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564822","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2103.15703","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2103.15703","pdf_url":"https://arxiv.org/pdf/2103.15703","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/108573","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/102e04fc-bd0a-44c5-b9ac-e2ec18987443","pdf_url":"https://aaltodoc.aalto.fi/handle/123456789/108573","source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"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":"info:eu-repo/semantics/article"},{"id":"mag:3152007678","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2103.15703","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/118483","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/39b95a77-ac8c-4f76-b6d0-390f12a7d780","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"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":"info:eu-repo/semantics/article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:13773","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.1","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2103.15703","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2103.15703","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.sea.2021.1","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sea.2021.1","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3564822","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564822","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564822","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3152007678.pdf","grobid_xml":"https://content.openalex.org/works/W3152007678.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1510700297","https://openalex.org/W1987123527","https://openalex.org/W1996575062","https://openalex.org/W1998644443","https://openalex.org/W2002516237","https://openalex.org/W2005944337","https://openalex.org/W2016124646","https://openalex.org/W2055314845","https://openalex.org/W2075312576","https://openalex.org/W2085761620","https://openalex.org/W2099544822","https://openalex.org/W2111332454","https://openalex.org/W2121765622","https://openalex.org/W2214182769","https://openalex.org/W2746372354","https://openalex.org/W2955681777","https://openalex.org/W2963794747","https://openalex.org/W2964010100","https://openalex.org/W2983782154","https://openalex.org/W3000986974","https://openalex.org/W3118443428","https://openalex.org/W3166491318","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W3165172697","https://openalex.org/W2951372599","https://openalex.org/W2964030863","https://openalex.org/W3131349932","https://openalex.org/W3104625252","https://openalex.org/W2789411239","https://openalex.org/W2005942657","https://openalex.org/W2295455748","https://openalex.org/W2964299325","https://openalex.org/W2104483759","https://openalex.org/W2772612740","https://openalex.org/W2296003088","https://openalex.org/W2022155283","https://openalex.org/W1548245245","https://openalex.org/W3040471007","https://openalex.org/W2963108172","https://openalex.org/W2735449077","https://openalex.org/W2963996796","https://openalex.org/W2964175068","https://openalex.org/W3133121354"],"abstract_inverted_index":{"Vertex":[0],"connectivity":[1,29,171],"is":[2,14,33,41,45,93],"a":[3,31,46,114,118,181],"well-studied":[4],"concept":[5],"in":[6],"graph":[7,13,32,40],"theory":[8],"with":[9,87,159,169,202],"numerous":[10],"applications.":[11],"A":[12],"k":[15,24,36,42,64,92],"-connected":[16],"if":[17],"it":[18],"remains":[19],"connected":[20],"after":[21],"removing":[22],"any":[23],"\u22121":[25],"vertices.":[26],"The":[27],"vertex":[28,55,161,170],"of":[30,49,103,183,204],"the":[34,39,76,100,104,133,147,176,187,209],"maximum":[35],"such":[37],"that":[38,132],"-connected.":[43],"There":[44],"long":[47],"history":[48],"algorithmic":[50],"development":[51],"for":[52,62,142,192,199],"efficiently":[53],"computing":[54],"connectivity.":[56],"Recently,":[57],"two":[58],"near":[59],"linear-time":[60],"algorithms":[61,105],"small":[63,193,220],"were":[65],"introduced":[66],"by":[67,81,106,213],"Forster":[68,107],"et":[69,83,108,215],"al.":[70,84,109],"[SODA":[71],"2020].":[72],"Prior":[73],"to":[74,149,153],"that,":[75],"best-known":[77],"algorithm":[78,212],"was":[79],"one":[80],"Henzinger":[82,214],"[FOCS":[85],"1996]":[86],"quadratic":[88],"running":[89],"time":[90],"when":[91],"small.":[94],"In":[95,110],"this":[96],"article,":[97],"we":[98,112,126],"study":[99],"practical":[101],"performance":[102],"addition,":[111],"introduce":[113],"new":[115,134],"heuristic":[116,135,179],"on":[117,156,218],"key":[119],"subroutine":[120,148],"called":[121],"local":[122],"cut":[123],"detection,":[124],"which":[125],"call":[127],"degree":[128,177],"counting.":[129],"We":[130],"prove":[131],"improves":[136],"space-efficiency":[137],"(which":[138],"can":[139],"be":[140],"good":[141],"caching":[143],"purposes)":[144],"and":[145,166,174,195],"allows":[146],"terminate":[150],"earlier.":[151],"According":[152],"experimental":[154],"results":[155],"random":[157,163],"graphs":[158,168,194,201],"planted":[160],"cuts,":[162],"hyperbolic":[164],"graphs,":[165],"real-world":[167],"between":[172],"4":[173],"8,":[175],"counting":[178,190],"offers":[180],"factor":[182],"2\u20134":[184],"speedup":[185],"over":[186],"original":[188],"non-degree":[189],"version":[191],"almost":[196],"20":[197],"times":[198],"some":[200],"millions":[203],"edges.":[205],"It":[206],"also":[207],"outperforms":[208],"previous":[210],"state-of-the-art":[211],"al.,":[216],"even":[217],"relatively":[219],"graphs.":[221]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}