{"id":"https://openalex.org/W7100477274","doi":null,"title":"BMC: An Efficient Method to Evaluate Probablistic Reachability Queries","display_name":"BMC: An Efficient Method to Evaluate Probablistic Reachability Queries","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7100477274"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.420.5286","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.5286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unsw.edu.au/~lxue/paper/BMC_dasfaa.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7100477274"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ke Zhu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ke Zhu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Wenjie Zhang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wenjie Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014952133","display_name":"Gaoping Zhu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gaoping Zhu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100386104","display_name":"Ying Zhang","orcid":"https://orcid.org/0000-0002-2674-1638","observed_orcids":["https://orcid.org/0000-0002-2674-1638","https://orcid.org/0009-0006-4418-7024"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ying Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5079659938","display_name":"Xuemin Lin","orcid":"https://orcid.org/0000-0003-2396-7225","observed_orcids":["https://orcid.org/0000-0003-2396-7225"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xuemin Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9560999870300293,"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.9560999870300293,"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/T11106","display_name":"Data Management and Algorithms","score":0.01679999940097332,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.014700000174343586,"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.9850000143051147},{"id":"https://openalex.org/keywords/graph-databases","display_name":"graph databases","score":0.7549999952316284},{"id":"https://openalex.org/keywords/reachability-probability","display_name":"reachability probability","score":0.5950000286102295},{"id":"https://openalex.org/keywords/dynamic-monte-carlo-simulation","display_name":"dynamic Monte Carlo simulation","score":0.7850000262260437},{"id":"https://openalex.org/keywords/query-pruning","display_name":"query pruning","score":0.7390000224113464},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.6919999718666077}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9690999984741211},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7541000247001648},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6862999796867371},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6294000148773193},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6110000014305115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5286999940872192},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4986000061035156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37700000405311584},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3025999963283539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3021000027656555},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.28519999980926514},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C147037132","wikidata":"https://www.wikidata.org/wiki/Q6865426","display_name":"Minimum bounding box","level":3,"score":0.2660999894142151},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.420.5286","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.5286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unsw.edu.au/~lxue/paper/BMC_dasfaa.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":0,"referenced_works":[],"related_works":["https://openalex.org/W2151281106","https://openalex.org/W2324265713","https://openalex.org/W2324517690","https://openalex.org/W6889746143","https://openalex.org/W202288158","https://openalex.org/W2331877186","https://openalex.org/W7097838354","https://openalex.org/W2912136951","https://openalex.org/W1510148020","https://openalex.org/W2808620023"],"abstract_inverted_index":{"Abstract.":[0],"Reachability":[1],"query":[2,164],"is":[3,28],"a":[4,17,20,24,61,67,84,91,96,103],"fundamental":[5],"problem":[6,78],"in":[7,31,53,60,83],"graph":[8,62],"databases.":[9],"It":[10],"answers":[11],"whether":[12],"or":[13],"not":[14],"there":[15],"exists":[16],"path":[18],"between":[19,136],"source":[21,92,138],"vertex":[22,26,93,98],"and":[23,27,42,124,139,173,182],"destination":[25,97],"widely":[29],"used":[30],"various":[32],"applications":[33],"including":[34],"road":[35],"networks,":[36,38],"social":[37],"world":[39],"wide":[40],"web":[41],"bioinformatics.":[43],"In":[44,71],"some":[45],"emerging":[46],"important":[47],"applications,":[48],"uncertainties":[49],"may":[50],"be":[51,64,118,157],"inherent":[52],"the":[54,76,130,137,142,148,161,180],"graphs.":[55],"For":[56],"instance,":[57],"each":[58],"edge":[59],"could":[63,94],"associated":[65],"with":[66,99,165],"probability":[68,106,135],"to":[69,88,117,128,146,159,178],"appear.":[70],"this":[72],"paper,":[73],"we":[74],"study":[75],"reachability":[77,110,134,163],"over":[79,171],"such":[80],"uncertain":[81,112],"graphs":[82,113],"threshold":[85],"fashion,":[86],"namely,":[87],"determine":[89],"if":[90],"reach":[95],"probabilty":[100],"larger":[101],"than":[102],"user":[104],"specified":[105],"value":[107],"t.":[108],"Finding":[109],"on":[111],"has":[114],"been":[115],"proved":[116],"NP-Hard.":[119],"We":[120],"first":[121],"propose":[122],"novel":[123],"effective":[125],"bounding":[126],"techniques":[127],"obtain":[129],"upper":[131,143],"bound":[132,144],"of":[133,184],"destination.":[140],"If":[141],"fails":[145],"prune":[147],"query,":[149],"efficient":[150],"dynamic":[151],"Monte":[152],"Carlo":[153],"simulation":[154],"technqiues":[155],"will":[156],"applied":[158],"answer":[160],"probabilitistic":[162],"an":[166],"accuracy":[167],"guarantee.":[168],"Extensive":[169],"experiments":[170],"real":[172],"synthetic":[174],"datasets":[175],"are":[176],"conducted":[177],"demonstrate":[179],"efficiency":[181],"effectiveness":[183],"our":[185],"techniques.":[186],"1":[187]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7100477274","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
