{"id":"https://openalex.org/W2139694815","doi":"https://doi.org/10.14778/2002938.2002941","title":"Distance-constraint reachability computation in uncertain graphs","display_name":"Distance-constraint reachability computation in uncertain graphs","alternate_titles":[],"publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2139694815","doi":"https://doi.org/10.14778/2002938.2002941","mag":"2139694815"},"language":"en","primary_location":{"id":"doi:10.14778/2002938.2002941","doi":"https://doi.org/10.14778/2002938.2002941","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2002938.2002941","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","norway-2","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2139694815"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5103270436","display_name":"Ruoming Jin","orcid":"https://orcid.org/0000-0003-1895-4243","observed_orcids":["https://orcid.org/0000-0003-1895-4243"]},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruoming Jin","raw_affiliation_strings":["Kent State University, Kent, OH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100383342","display_name":"Lin Liu","orcid":"https://orcid.org/0000-0003-2843-5738","observed_orcids":["https://orcid.org/0000-0003-2843-5738"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lin Liu","raw_affiliation_strings":["UIUC, Urbana, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UIUC, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040297543","display_name":"Bolin Ding","orcid":"https://orcid.org/0000-0003-1535-9692","observed_orcids":["https://orcid.org/0000-0003-1535-9692"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bolin Ding","raw_affiliation_strings":["UIUC, Urbana, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UIUC, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063351917","display_name":"Haixun Wang","orcid":"https://orcid.org/0009-0007-0773-7004","observed_orcids":["https://orcid.org/0009-0007-0773-7004"]},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haixun Wang","raw_affiliation_strings":["Microsoft Research Asia, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia, Beijing, China","institution_ids":["https://openalex.org/I4210113369"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.6656,"has_fulltext":false,"cited_by_count":176,"citation_normalized_percentile":{"value":0.99292047,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":"4","issue":"9","first_page":"551","last_page":"562"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9258000254631042,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9258000254631042,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.0210999995470047,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.01640000008046627,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/uncertain-graphs","display_name":"uncertain graphs","score":0.9520000219345093},{"id":"https://openalex.org/keywords/probabilistic-reachability","display_name":"probabilistic reachability","score":0.9330000281333923},{"id":"https://openalex.org/keywords/variance-reduction","display_name":"variance reduction","score":0.7860000133514404},{"id":"https://openalex.org/keywords/online-approximation","display_name":"online approximation","score":0.8050000071525574},{"id":"https://openalex.org/keywords/p-completeness","display_name":"#P-completeness","score":0.7829999923706055}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8592279553413391},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.8529477119445801},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5927423238754272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5768133997917175},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5691619515419006},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5350198745727539},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.513908863067627},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5024168491363525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38297268748283386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37066489458084106},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3543228805065155},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15118780732154846},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1274583637714386},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.14778/2002938.2002941","doi":"https://doi.org/10.14778/2002938.2002941","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2002938.2002941","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","norway-2","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.784","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.784","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unt.edu/%7Ehuangyan/6350/paper/distance.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.295.5041","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.5041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kent.edu/~jin/Papers/pvldb11_uncertainreachability.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W68111493","https://openalex.org/W157655559","https://openalex.org/W157725869","https://openalex.org/W165814954","https://openalex.org/W1490591387","https://openalex.org/W1510148020","https://openalex.org/W1663493649","https://openalex.org/W1968895412","https://openalex.org/W1973968359","https://openalex.org/W1991536882","https://openalex.org/W2008620264","https://openalex.org/W2042587503","https://openalex.org/W2057272970","https://openalex.org/W2078331965","https://openalex.org/W2080182143","https://openalex.org/W2099083325","https://openalex.org/W2100047952","https://openalex.org/W2101720181","https://openalex.org/W2103012681","https://openalex.org/W2104577053","https://openalex.org/W2110138423","https://openalex.org/W2115826669","https://openalex.org/W2117889403","https://openalex.org/W2122410182","https://openalex.org/W2137442080","https://openalex.org/W2138972795","https://openalex.org/W2144780381","https://openalex.org/W2158501189","https://openalex.org/W2161184219","https://openalex.org/W2166065253","https://openalex.org/W2168110243","https://openalex.org/W2170827956","https://openalex.org/W2480214119","https://openalex.org/W2491780404","https://openalex.org/W4245681882","https://openalex.org/W6678087030","https://openalex.org/W7021126095","https://openalex.org/W7095077797"],"related_works":["https://openalex.org/W202288158","https://openalex.org/W104377239","https://openalex.org/W2324265713","https://openalex.org/W2151281106","https://openalex.org/W2331877186","https://openalex.org/W2134277721","https://openalex.org/W7100477274","https://openalex.org/W7098003496","https://openalex.org/W6889746143"],"abstract_inverted_index":{"Driven":[0],"by":[1],"the":[2,29,42,45,62,87,98,104,126,137,173],"emerging":[3],"network":[4],"applications,":[5],"querying":[6],"and":[7,38,74,103,169,175],"mining":[8],"uncertain":[9,24,63],"graphs":[10],"has":[11],"become":[12],"increasingly":[13],"important.":[14],"In":[15],"this":[16,66],"paper,":[17],"we":[18,27,70],"investigate":[19],"a":[20,57,92,107,115,121],"fundamental":[21],"problem":[22,67],"concerning":[23],"graphs,":[25],"which":[26,112,141],"call":[28],"distance-constraint":[30],"reachability":[31],"(DCR)":[32],"problem:":[33],"Given":[34],"two":[35,83],"vertices":[36],"s":[37,48],"t,":[39],"what":[40],"is":[41,51,68,91,106],"probability":[43],"that":[44],"distance":[46],"from":[47],"to":[49,56,124,145,155],"t":[50],"less":[52],"than":[53,136],"or":[54,149],"equal":[55],"user-defined":[58],"threshold":[59],"d":[60],"in":[61],"graph?":[64],"Since":[65],"#P-Complete,":[69],"focus":[71],"on":[72,97,166],"efficiently":[73],"accurately":[75],"approximating":[76],"DCR":[77],"online.":[78],"Our":[79],"main":[80],"results":[81],"include":[82],"new":[84,179],"estimators":[85,130,158],"for":[86],"probabilistic":[88,100],"reachability.":[89],"One":[90],"Horvitz-Thomson":[93],"type":[94],"estimator":[95],"based":[96],"unequal":[99],"sampling":[101,110,122,139],"scheme,":[102],"other":[105],"novel":[108],"recursive":[109,117],"estimator,":[111,140],"effectively":[113],"combines":[114],"deterministic":[116],"computational":[118],"procedure":[119],"with":[120],"process":[123],"boost":[125],"estimation":[127],"accuracy.":[128],"Both":[129],"can":[131],"produce":[132],"much":[133],"smaller":[134],"variance":[135],"direct":[138],"considers":[142],"each":[143],"trial":[144],"be":[146],"either":[147],"1":[148],"0.":[150],"We":[151],"also":[152],"present":[153],"methods":[154],"make":[156],"these":[157],"more":[159],"computationally":[160],"efficient.":[161],"The":[162],"comprehensive":[163],"experiment":[164],"evaluation":[165],"both":[167],"real":[168],"synthetic":[170],"datasets":[171],"demonstrates":[172],"efficiency":[174],"accuracy":[176],"of":[177],"our":[178],"estimators.":[180]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2139694815","counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":11}],"updated_date":"2026-11-18T13:11:19.462570","created_date":"2016-06-24T00:00:00"}
