{"id":"https://openalex.org/W4225858648","doi":"https://doi.org/10.1145/3519935.3519945","title":"Optimal vertex connectivity oracles","display_name":"Optimal vertex connectivity oracles","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4225858648","doi":"https://doi.org/10.1145/3519935.3519945"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3519945","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010547647","display_name":"Thatchaphol Saranurak","orcid":"https://orcid.org/0000-0001-8386-7168"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thatchaphol Saranurak","raw_affiliation_strings":["University of Michigan, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108276380","display_name":"Longhui Yin","orcid":"https://orcid.org/0000-0001-5696-5678"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Longhui Yin","raw_affiliation_strings":["Tsinghua University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"151","last_page":"161"},"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.9994999766349792,"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.9994999766349792,"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/T10237","display_name":"Cryptography and Data Security","score":0.9991000294685364,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7734351754188538},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.7476335763931274},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7063192129135132},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6234514117240906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6063165664672852},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46043577790260315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4284627139568329},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3897043764591217},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3861994743347168},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3734765350818634},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10372373461723328}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7734351754188538},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7476335763931274},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7063192129135132},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6234514117240906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6063165664672852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46043577790260315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4284627139568329},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3897043764591217},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3861994743347168},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3734765350818634},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10372373461723328},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3519945","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W157855400","https://openalex.org/W390146837","https://openalex.org/W976211528","https://openalex.org/W1485486436","https://openalex.org/W1678386955","https://openalex.org/W1804493368","https://openalex.org/W1880391707","https://openalex.org/W1964510837","https://openalex.org/W1972631197","https://openalex.org/W1975905867","https://openalex.org/W1976118519","https://openalex.org/W1996575062","https://openalex.org/W2006162221","https://openalex.org/W2007557148","https://openalex.org/W2008343880","https://openalex.org/W2023856768","https://openalex.org/W2024366499","https://openalex.org/W2038054184","https://openalex.org/W2042125957","https://openalex.org/W2042604558","https://openalex.org/W2043428092","https://openalex.org/W2054698857","https://openalex.org/W2066433035","https://openalex.org/W2069001533","https://openalex.org/W2115049345","https://openalex.org/W2146747282","https://openalex.org/W2162003279","https://openalex.org/W2276245879","https://openalex.org/W2336317531","https://openalex.org/W2405374478","https://openalex.org/W2949942995","https://openalex.org/W2983782154","https://openalex.org/W2988480584","https://openalex.org/W3000986974","https://openalex.org/W3035645591","https://openalex.org/W3037081898","https://openalex.org/W3043435921","https://openalex.org/W3078970133","https://openalex.org/W3126916987","https://openalex.org/W3127894499","https://openalex.org/W3129188913","https://openalex.org/W3131420626","https://openalex.org/W3166491318","https://openalex.org/W3170659189","https://openalex.org/W4230894037","https://openalex.org/W4389615663","https://openalex.org/W4394641466","https://openalex.org/W4401657621"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2562400057","https://openalex.org/W1692008701","https://openalex.org/W2597588799","https://openalex.org/W2073713056","https://openalex.org/W4390575969"],"abstract_inverted_index":{"A":[0],"k-vertex":[1],"connectivity":[2,23],"oracle":[3],"for":[4],"undirected":[5],"G":[6],"is":[7,19,79],"a":[8,51,64],"data":[9,52],"structure":[10,53],"that,":[11],"given":[12],"u,v\u2208":[13],"V(G),":[14],"reports":[15],"min{k,\u03ba(u,v)},":[16],"where":[17],"\u03ba(u,v)":[18],"the":[20],"pairwise":[21],"vertex":[22],"between":[24],"u,v.":[25],"There":[26],"are":[27],"three":[28],"main":[29],"measures":[30],"of":[31,41,54],"efficiency:":[32],"construction":[33,77],"time,":[34,36],"query":[35],"and":[37,43],"space.":[38],"Prior":[39],"work":[40],"Izsak":[42],"Nutov":[44],"[Inf.":[45],"Process.":[46],"Lett.":[47],"2012]":[48],"shows":[49],"that":[50],"total":[55],"size":[56],"O(knlogn),":[57],"which":[58],"can":[59,69],"even":[60],"be":[61],"encoded":[62],"as":[63],"O(klog3":[65],"n)-bit":[66],"labeling":[67],"scheme,":[68],"answer":[70],"vertex-connectivity":[71],"queries":[72],"in":[73],"O(klogn)":[74],"time.":[75],"The":[76],"time":[78],"polynomial,":[80],"but":[81],"unspecified.":[82]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}