{"id":"https://openalex.org/W2078960854","doi":"https://doi.org/10.1137/0222013","title":"Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity","display_name":"Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity","publication_year":1993,"publication_date":"1993-02-01","ids":{"openalex":"https://openalex.org/W2078960854","doi":"https://doi.org/10.1137/0222013","mag":"2078960854"},"language":"en","primary_location":{"id":"doi:10.1137/0222013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222013","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5046805470","display_name":"Joseph Cheriyan","orcid":"https://orcid.org/0000-0003-0316-7650"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Joseph Cheriyan","raw_affiliation_strings":["University of Waterloo, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109219665","display_name":"Ming\u2010Yang Kao","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ming-Yang Kao","raw_affiliation_strings":["Duke University Durham NC"],"affiliations":[{"raw_affiliation_string":"Duke University Durham NC","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039862374","display_name":"Ramakrishna Thurimella","orcid":null},"institutions":[{"id":"https://openalex.org/I131651094","display_name":"University of Denver","ror":"https://ror.org/04w7skc03","country_code":"US","type":"education","lineage":["https://openalex.org/I131651094"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramakrishna Thurimella","raw_affiliation_strings":["University of Denver, Denver, Co"],"affiliations":[{"raw_affiliation_string":"University of Denver, Denver, Co","institution_ids":["https://openalex.org/I131651094"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046805470"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":7.1183,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.97350053,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"22","issue":"1","first_page":"157","last_page":"174"},"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.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"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/combinatorics","display_name":"Combinatorics","score":0.700452983379364},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6300240755081177},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6042253971099854},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5448848605155945},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5240198373794556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46191027760505676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42045366764068604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41108939051628113},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39249077439308167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3683539927005768}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.700452983379364},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6300240755081177},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6042253971099854},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5448848605155945},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5240198373794556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46191027760505676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42045366764068604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41108939051628113},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39249077439308167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3683539927005768}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0222013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222013","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1768940763","https://openalex.org/W1971061054","https://openalex.org/W1996575062","https://openalex.org/W2018049652","https://openalex.org/W2020283440","https://openalex.org/W2022175859","https://openalex.org/W2035435951","https://openalex.org/W2049327803","https://openalex.org/W2050021819","https://openalex.org/W2052184941","https://openalex.org/W2088570605","https://openalex.org/W2118382442","https://openalex.org/W2121765622","https://openalex.org/W2610479830","https://openalex.org/W2752885492","https://openalex.org/W4231938090"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W78560857"],"abstract_inverted_index":{"Given":[0],"a":[1,6,61,71,137,150,199,252,257],"graph":[2,62,117,189,244,259],"$G":[3],"=":[4],"(V,E)$,":[5],"certificate":[7,46,72,164,176,245,260],"of":[8,41,93,97,104,108,115,145,186,205,219,227],"k-vertex":[9,24,32,184],"connectivity":[10,185],"is":[11,23,31,47,142],"an":[12,187,237,242],"edge":[13],"subset":[14],"$E'":[15],"\\subset":[16],"E$":[17],"such":[18],"that":[19,70,120],"the":[20,39,65,98,106,112,124,143,162,183,213,217],"subgraph":[21],"$(V,E')$":[22],"connected":[25,155],"if":[26,29,50],"and":[27,36,43,68,101,161,208,216,251],"only":[28],"G":[30],"connected.":[33],"Let":[34],"n":[35],"m":[37],"denote":[38],"number":[40,144,218],"vertices":[42],"edges.":[44,54,266],"A":[45],"called":[48,64],"sparse":[49],"it":[51],"contains":[52],"$O(kn)$":[53],"For":[55,95,202],"undirected":[56,188,243],"graphs,":[57],"this":[58],"paper":[59,234],"introduces":[60],"search":[63,86,110,118,127],"scan-first":[66,85,109,126],"search,":[67],"shows":[69],"with":[73,246,261],"at":[74,247,262],"most":[75,248,263],"$k(n":[76],"-":[77],"1)$":[78],"edges":[79],"can":[80,178],"be":[81,179],"computed":[82],"by":[83],"executing":[84],"k":[87],"times":[88],"in":[89,129,153,157,167,190],"sequence":[90],"on":[91,119,136,198,223],"subgraphs":[92],"G.":[94],"each":[96,154],"parallel,":[99],"distributed,":[100],"sequential":[102,253],"models":[103],"computation,":[105],"complexity":[107,114],"matches":[111],"best":[113],"any":[116],"model.":[121],"In":[122],"particular,":[123],"parallel":[125,163,175,231],"runs":[128,166],"$O(\\log":[130,158],"n)$":[131,159,169,193],"time":[132,170,194,215],"using":[133,171,195],"$C(n,m)$":[134,141,172],"processors":[135,146,197,220],"CRCW":[138,200],"PRAM,":[139],"where":[140],"needed":[147],"to":[148,181],"find":[149],"spanning":[151],"tree":[152],"component":[156],"time,":[160],"algorithm":[165,177,239,254],"$O(k\\log":[168],"processors.":[173],"The":[174],"employed":[180],"test":[182],"$O(k^2":[191],"\\log":[192],"$knC(n,kn)$":[196],"PRAM.":[201],"all":[203,228],"combinations":[204],"n,":[206],"m,":[207],"$k":[209],">":[210],"3$,":[211],"both":[212],"running":[214],"either":[221],"improve":[222],"or":[224],"match":[225],"those":[226],"known":[229],"deterministic":[230],"algorithms.":[232],"This":[233],"also":[235],"obtains":[236],"online":[238],"for":[240,255],"computing":[241,256],"$2kn$":[249],"edges,":[250],"directed":[258],"$2k^2":[264],"n$":[265]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}