{"id":"https://openalex.org/W2107280545","doi":"https://doi.org/10.1137/070697793","title":"Network Failure Detection and Graph Connectivity","display_name":"Network Failure Detection and Graph Connectivity","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2107280545","doi":"https://doi.org/10.1137/070697793","mag":"2107280545"},"language":"en","primary_location":{"id":"doi:10.1137/070697793","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070697793","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/A5055710645","display_name":"Jon Kleinberg","orcid":"https://orcid.org/0000-0002-1929-2512"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jon Kleinberg","raw_affiliation_strings":["kleinber@cs.cornell.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"kleinber@cs.cornell.edu#TAB#","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076173089","display_name":"M. Sandler","orcid":"https://orcid.org/0000-0002-5691-8107"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark Sandler","raw_affiliation_strings":["sandler@google.com#TAB#"],"affiliations":[{"raw_affiliation_string":"sandler@google.com#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058550942","display_name":"Aleksandrs Slivkins","orcid":"https://orcid.org/0000-0001-6899-6383"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aleksandrs Slivkins","raw_affiliation_strings":["slivkins@microsoft.com#TAB#"],"affiliations":[{"raw_affiliation_string":"slivkins@microsoft.com#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055710645"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":0.5854,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.79017249,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"4","first_page":"1330","last_page":"1346"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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.9987000226974487,"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.6925550699234009},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6607115268707275},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.635638415813446},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.5589564442634583},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5512387752532959},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5405735969543457},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.485621839761734},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44979995489120483},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4448445439338684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3353198170661926},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.13681459426879883}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6925550699234009},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6607115268707275},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.635638415813446},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.5589564442634583},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5512387752532959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5405735969543457},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.485621839761734},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44979995489120483},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4448445439338684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3353198170661926},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13681459426879883},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070697793","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070697793","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1986334784","https://openalex.org/W2005075461","https://openalex.org/W2028942728","https://openalex.org/W2036159029","https://openalex.org/W2048815229","https://openalex.org/W2056886763","https://openalex.org/W2096320713","https://openalex.org/W2111332454","https://openalex.org/W2154952480","https://openalex.org/W2599087550","https://openalex.org/W4234163381","https://openalex.org/W4249772428"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W4255576661","https://openalex.org/W1516574938","https://openalex.org/W2563912921","https://openalex.org/W2407611282"],"abstract_inverted_index":{"We":[0,65,173],"consider":[1],"a":[2,9,68,120,188,262,269,277,304,311,327],"model":[3],"for":[4,78,107,176,272,306,314],"monitoring":[5],"the":[6,57,82,128,145,152,231,238,284,287,296,317],"connectivity":[7,171],"of":[8,45,56,71,81,116,127,130,151,191,205,230,233,237,240,257,265,279,289,299,303,322,326],"network":[10,34],"subject":[11],"to":[12,32,93,245,282],"node":[13,246,307],"or":[14,37],"edge":[15],"failures.":[16],"In":[17,132],"particular,":[18],"we":[19,135,156,291,309],"are":[20,42,60,89,226],"concerned":[21],"with":[22,316],"detecting":[23],"$(\\epsilon,k)$-failures:":[24],"events":[25],"in":[26,87,95,122,216],"which":[27,40,194],"an":[28,53,74,113,177,202],"adversary":[29,178],"deletes":[30],"up":[31,281],"k":[33,123],"elements":[35],"(nodes":[36],"edges),":[38],"after":[39],"there":[41,111,185],"two":[43,85],"sets":[44,143],"nodes":[46,72,86,267,280],"A":[47,219],"and":[48,124,144,148,295],"B,":[49],"each":[50],"at":[51,210],"least":[52],"$\\epsilon$":[54],"fraction":[55],"network,":[58,83],"that":[59,67,106,158,175,179,223,261,274],"disconnected":[61],"from":[62],"one":[63],"another.":[64],"say":[66],"set":[69,76,115,160,190,204,271,321],"D":[70,88,98],"is":[73,112,186,209,222,248,260,268],"$(\\epsilon,k)$-detection":[75,114],"if,":[77],"any":[79,100,108],"$(\\epsilon,k)$-failure":[80],"some":[84,137],"no":[90],"longer":[91],"able":[92],"communicate;":[94],"this":[96,133,258],"way,":[97],"\u201cwitnesses\u201d":[99],"such":[101],"failure.":[102],"Recent":[103],"results":[104],"show":[105,157,174],"graph":[109],"G,":[110],"size":[117,129,192,207,232],"bounded":[118],"by":[119,169,198],"polynomial":[121,217],"$\\epsilon$,":[125],"independent":[126,227],"G.":[131],"paper,":[134],"expose":[136],"relationships":[138],"between":[139],"bounds":[140,161,225,244],"on":[141],"detection":[142,159,189,270],"edge-connectivity":[146],"$\\lambda$":[147],"node-connectivity":[149],"$\\kappa$":[150],"underlying":[153],"graph.":[154,328],"Specifically,":[155],"can":[162,180,195,213,275],"be":[163,196,214],"made":[164],"considerably":[165],"stronger":[166],"when":[167],"parameterized":[168],"these":[170,224,243],"values.":[172],"delete":[181,276],"$k":[182],"\\lambda$":[183],"edges,":[184],"always":[187],"$O(\\frac{k}{\\epsilon}\\log\\frac{1}{\\epsilon})$":[193],"found":[197],"random":[199,263],"sampling.":[200],"Moreover,":[201],"$(\\epsilon,\\lambda)$-detection":[203],"minimum":[206,301,324],"(which":[208],"most":[211,253],"$\\frac{1}{\\epsilon}$)":[212],"computed":[215],"time.":[218],"crucial":[220],"point":[221],"not":[228],"just":[229],"G":[234],"but":[235],"also":[236],"value":[239],"$\\lambda$.":[241],"Extending":[242],"failures":[247],"much":[249,318],"more":[250,319],"challenging.":[251],"The":[252],"technically":[254],"difficult":[255],"result":[256],"paper":[259],"sample":[264],"$O(\\frac{1}{\\epsilon}\\log\\frac{1}{\\epsilon})$":[266],"adversaries":[273],"number":[278],"$\\kappa$,":[283],"node-connectivity.":[285],"For":[286],"case":[288],"edge-failures":[290],"use":[292],"VC-dimension":[293],"techniques":[294],"cactus":[297],"representation":[298],"all":[300,323],"edge-cuts":[302],"graph;":[305],"failures,":[308],"develop":[310],"novel":[312],"approach":[313],"working":[315],"complex":[320],"node-cuts":[325]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}