{"id":"https://openalex.org/W2141257824","doi":"https://doi.org/10.1145/1806689.1806754","title":"Connectivity oracles for failure prone graphs","display_name":"Connectivity oracles for failure prone graphs","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2141257824","doi":"https://doi.org/10.1145/1806689.1806754","mag":"2141257824"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806754","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM 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/A5101897550","display_name":"Ran Duan","orcid":"https://orcid.org/0009-0007-0934-0684"},"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":"Ran Duan","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","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, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"465","last_page":"474"},"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.9994000196456909,"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.9994000196456909,"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.9993000030517578,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.6783589720726013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5092984437942505},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47714492678642273},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.344917356967926},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27540504932403564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25874829292297363}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6783589720726013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5092984437942505},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47714492678642273},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.344917356967926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27540504932403564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25874829292297363}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1806689.1806754","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.192.3148","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.3148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Eduanran/d-failure-connectivity.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1577501260","https://openalex.org/W1974785036","https://openalex.org/W1979232449","https://openalex.org/W1986633843","https://openalex.org/W1989169588","https://openalex.org/W1999644473","https://openalex.org/W2031592993","https://openalex.org/W2040746822","https://openalex.org/W2045430818","https://openalex.org/W2058084873","https://openalex.org/W2074286662","https://openalex.org/W2088844265","https://openalex.org/W2095681182","https://openalex.org/W2117909275","https://openalex.org/W2118914279","https://openalex.org/W2120724233","https://openalex.org/W2125712182","https://openalex.org/W2132676992","https://openalex.org/W2139666321","https://openalex.org/W2148025043","https://openalex.org/W2157901347","https://openalex.org/W2165513755","https://openalex.org/W2611854190","https://openalex.org/W6645146280"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Dynamic":[0],"graph":[1,20,43,52,90],"connectivity":[2],"algorithms":[3],"have":[4],"been":[5],"studied":[6],"for":[7],"many":[8],"years,":[9],"but":[10,107],"typically":[11],"in":[12,23,91],"the":[13,19,71,86,89,113],"most":[14,81],"general":[15],"possible":[16],"setting,":[17],"where":[18,66,85],"can":[21,45],"evolve":[22],"completely":[24],"arbitrary":[25],"ways.":[26],"In":[27],"this":[28],"paper":[29],"we":[30],"consider":[31],"a":[32,94],"dynamic":[33],"subgraph":[34,72],"model.":[35],"We":[36],"assume":[37],"there":[38],"is":[39,53,100],"some":[40],"fixed,":[41],"underlying":[42],"that":[44],"be":[46],"preprocessed":[47],"ahead":[48],"of":[49,88],"time.":[50],"The":[51],"subject":[54],"only":[55],"to":[56,70,104],"vertices":[57],"and":[58,63],"edges":[59],"flipping":[60],"\"off\"":[61],"(failing)":[62],"\"on\"":[64],"(recovering),":[65],"queries":[67],"naturally":[68],"apply":[69],"on":[73],"edges/vertices":[74],"currently":[75],"flipped":[76],"on.":[77],"This":[78],"model":[79],"fits":[80],"real":[82],"world":[83],"scenarios,":[84],"topology":[87],"question":[92],"(say":[93],"router":[95],"network":[96],"or":[97],"road":[98],"network)":[99],"constantly":[101],"evolving":[102],"due":[103],"temporary":[105],"failures":[106],"never":[108],"deviates":[109],"too":[110],"far":[111],"from":[112],"ideal":[114],"failure-free":[115],"state.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}