{"id":"https://openalex.org/W7118325182","doi":"https://doi.org/10.1137/1.9781611978964.16","title":"A (Very) Nearly Optimal Sketch for \\(k\\)-Edge Connectivity Certificates","display_name":"A (Very) Nearly Optimal Sketch for \\(k\\)-Edge Connectivity Certificates","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118325182","doi":"https://doi.org/10.1137/1.9781611978964.16"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978964.16","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.16","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","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/A5098402066","display_name":"Pachara Sawettamalya","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pachara Sawettamalya","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055157975","display_name":"Huacheng Yu","orcid":"https://orcid.org/0000-0003-1450-1896"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Huacheng Yu","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10366144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"229","last_page":"240"},"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.9003000259399414,"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.9003000259399414,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.032099999487400055,"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/T10237","display_name":"Cryptography and Data Security","score":0.012199999764561653,"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/sketch","display_name":"Sketch","score":0.6660000085830688},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.47110000252723694},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45570001006126404},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4075999855995178},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4034999907016754},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4034999907016754}],"concepts":[{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.6660000085830688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5023999810218811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49079999327659607},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47690001130104065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4763000011444092},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.47110000252723694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4659999907016754},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45570001006126404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44510000944137573},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4075999855995178},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4034999907016754},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4034999907016754},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3506999909877777},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.35010001063346863},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.3476000130176544},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2538999915122986}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978964.16","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.16","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,82],"this":[1],"note,":[2],"we":[3],"present":[4],"a":[5,10,109,117],"simple":[6],"algorithm":[7,18,39,85],"for":[8,94,116],"computing":[9],"\\(k\\)-connectivity":[11],"certificate":[12],"in":[13],"dynamic":[14],"graph":[15],"streams.":[16],"Our":[17],"uses":[19],"\\(O(n":[20],"\\log^2":[21],"n":[22,27,66,98,124],"\\cdot":[23,67],"\\max":[24,68],"\\{k,":[25,69],"\\log":[26,28,99,100,114,125,126],"k\\})\\)":[29],"bits":[30],"of":[31,40,49,112,120],"space":[32,56,89],"which":[33],"improves":[34],"upon":[35],"the":[36,47,61,88,104],"\\(O(kn\\log^3":[37],"n)\\)-space":[38],"Ahn,":[41],"Guha,":[42],"and":[43,75,79,102],"McGregor":[44],"(SODA\u201912).":[45],"For":[46],"values":[48],"\\(k\\)":[50],"that":[51],"are":[52],"truly":[53],"sublinear,":[54],"our":[55,84],"usage":[57],"very":[58],"nearly":[59],"matches":[60],"known":[62],"lower":[63],"bound":[64],"\\(\\Omega(n\\log^2":[65],"\\log\\,":[70],"n\\})\\)":[71],"established":[72],"by":[73],"Nelson":[74],"Yu":[76],"(SODA\u201919;":[77],"implicit)":[78],"Robinson":[80],"(DISC\u201924).":[81],"particular,":[83],"fully":[86],"settles":[87],"complexity":[90],"at":[91],"\\(\\Theta(kn\\log^2":[92],"n)\\)":[93,115],"\\(k":[95,121],"=":[96,122],"\\Omega(\\log":[97],"n)\\),":[101],"bridges":[103],"gap":[105],"down":[106],"to":[107],"only":[108],"doubly-logarithmic":[110],"factor":[111],"\\(O(\\log":[113],"smaller":[118],"range":[119],"o(\\log":[123],"n)\\).":[127]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2026-01-08T00:00:00"}