{"id":"https://openalex.org/W2741818905","doi":"https://doi.org/10.1109/tnet.2017.2725905","title":"Determining Source\u2013Destination Connectivity in Uncertain Networks: Modeling and Solutions","display_name":"Determining Source\u2013Destination Connectivity in Uncertain Networks: Modeling and Solutions","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2741818905","doi":"https://doi.org/10.1109/tnet.2017.2725905","mag":"2741818905"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2017.2725905","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2017.2725905","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","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/A5048486573","display_name":"Luoyi Fu","orcid":"https://orcid.org/0000-0001-7796-9168"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Luoyi Fu","raw_affiliation_strings":["Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049286032","display_name":"Xinzhe Fu","orcid":"https://orcid.org/0000-0002-4425-3881"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinzhe Fu","raw_affiliation_strings":["Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100301744","display_name":"Zhiying Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiying Xu","raw_affiliation_strings":["Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023774653","display_name":"Qianyang Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qianyang Peng","raw_affiliation_strings":["Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034483183","display_name":"Xinbing Wang","orcid":"https://orcid.org/0000-0002-0357-8356"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinbing Wang","raw_affiliation_strings":["Department of Computer Science, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020188879","display_name":"Songwu Lu","orcid":"https://orcid.org/0000-0003-3779-0918"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Songwu Lu","raw_affiliation_strings":["Department of Computer Science, University of California at Los Angeles, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California at Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5048486573"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":3.9368,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.94478451,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"25","issue":"6","first_page":"3237","last_page":"3252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9830999970436096,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9830999970436096,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.973800003528595,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9606999754905701,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.671262264251709},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5906230807304382},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5135881900787354},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4863920509815216},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.48075100779533386},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4582367241382599},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4562647342681885},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.42735472321510315},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4263232350349426},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4178575873374939},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3470025062561035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2873753011226654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2570173740386963},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09114649891853333}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.671262264251709},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5906230807304382},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5135881900787354},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4863920509815216},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.48075100779533386},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4582367241382599},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4562647342681885},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.42735472321510315},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4263232350349426},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4178575873374939},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3470025062561035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2873753011226654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2570173740386963},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09114649891853333},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2017.2725905","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2017.2725905","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1544210699","display_name":null,"funder_award_id":"61325012","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6041679325","display_name":null,"funder_award_id":"61532012","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6088092935","display_name":null,"funder_award_id":"61521062","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8607211670","display_name":null,"funder_award_id":"61602303","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G991532842","display_name":null,"funder_award_id":"91438115","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W104125573","https://openalex.org/W1542177083","https://openalex.org/W1636002480","https://openalex.org/W1669491564","https://openalex.org/W1784783114","https://openalex.org/W1835452851","https://openalex.org/W1975407578","https://openalex.org/W1987480024","https://openalex.org/W1991536882","https://openalex.org/W1992876208","https://openalex.org/W1993709643","https://openalex.org/W1998369386","https://openalex.org/W2026501144","https://openalex.org/W2031264603","https://openalex.org/W2037933327","https://openalex.org/W2042307930","https://openalex.org/W2061820396","https://openalex.org/W2066303519","https://openalex.org/W2082931591","https://openalex.org/W2094500233","https://openalex.org/W2099052762","https://openalex.org/W2107866581","https://openalex.org/W2110896443","https://openalex.org/W2112976607","https://openalex.org/W2119567691","https://openalex.org/W2125315567","https://openalex.org/W2126969025","https://openalex.org/W2129852705","https://openalex.org/W2130519052","https://openalex.org/W2136618432","https://openalex.org/W2139694815","https://openalex.org/W2155461593","https://openalex.org/W2158804164","https://openalex.org/W2167689112","https://openalex.org/W2274419069","https://openalex.org/W2401697020","https://openalex.org/W2522473921","https://openalex.org/W2589445910","https://openalex.org/W2730879255","https://openalex.org/W2761598111","https://openalex.org/W2951161395","https://openalex.org/W2962795549","https://openalex.org/W3098141196","https://openalex.org/W3160434771","https://openalex.org/W3217684393","https://openalex.org/W4232932184","https://openalex.org/W4298023569","https://openalex.org/W6637462544","https://openalex.org/W6676553512","https://openalex.org/W6679581042"],"related_works":["https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"Determination":[0],"of":[1,57,63,97,109,152,165,196,282,298],"source-destination":[2,155],"connectivity":[3,156],"in":[4,26,157,177,185,229],"networks":[5],"has":[6],"long":[7],"been":[8],"a":[9,60,65,69,75,80,107,136,142,211,247,288],"fundamental":[10],"problem,":[11,145,284],"where":[12,42],"most":[13],"existing":[14],"works":[15],"are":[16,72,89],"based":[17],"on":[18,307],"deterministic":[19,178],"graphs":[20,133],"that":[21,56,83,134,215,258,317],"overlook":[22],"the":[23,36,95,120,126,149,163,194,204,217,221,241,280,283,299,318],"inherent":[24],"uncertainty":[25],"network":[27,37,310],"links.":[28],"To":[29],"overcome":[30],"such":[31],"limitation,":[32],"this":[33,180],"paper":[34],"models":[35],"as":[38,260],"an":[39,92,116,198],"uncertain":[40,158],"graph,":[41,94],"each":[43,85,98],"edge":[44,99,104],"e":[45],"exists":[46],"independently":[47],"with":[48,91,125,251,292,323],"some":[49,271],"probability":[50],"p(e).":[51],"The":[52,243,296],"problem":[53,181],"examined":[54],"is":[55,113,246,302],"determining":[58,86,154],"whether":[59],"given":[61],"pair":[62],"nodes,":[64],"source":[66],"s":[67],"and":[68,263],"destination":[70],"t,":[71],"connected":[73],"by":[74,79,193,278],"path":[76],"or":[77],"separated":[78],"cut.":[81],"Assuming":[82],"during":[84],"process":[87,207],"we":[88,146,170,201,232,256,285,315],"associated":[90],"underlying":[93,132],"existence":[96],"can":[100],"be":[101,183],"unraveled":[102],"through":[103,161,304],"testing":[105,123],"at":[106],"cost":[108,124,326],"c(e).":[110],"Our":[111],"goal":[112],"to":[114,174,209],"find":[115],"optimal":[117,218],"strategy":[118],"incurring":[119],"minimum":[121],"expected":[122,325],"expectation":[127],"taken":[128],"over":[129],"all":[130],"possible":[131],"form":[135],"product":[137],"distribution.":[138],"Formulating":[139],"it":[140,261,264],"into":[141],"combinatorial":[143],"optimization":[144],"first":[147,244],"characterize":[148],"computational":[150],"complexity":[151,228],"optimally":[153],"graphs.":[159],"Specifically,":[160],"proving":[162],"NP-hardness":[164],"two":[166,235],"closely":[167],"related":[168],"problems,":[169],"show":[171,257],"that,":[172],"contrary":[173],"its":[175],"counterpart":[176],"graphs,":[179],"cannot":[182],"solved":[184],"polynomial":[186],"time":[187,227],"unless":[188],"P":[189],"=":[190],"NP.":[191],"Driven":[192],"necessity":[195],"designing":[197],"exact":[199,222],"algorithm,":[200],"then":[202],"apply":[203],"Markov":[205],"decision":[206],"framework":[208],"give":[210],"dynamic":[212],"programming":[213],"algorithm":[214,223,291],"derives":[216],"strategies.":[219],"As":[220],"may":[224],"have":[225],"prohibitive":[226],"practical":[230],"situations,":[231],"further":[233,286],"propose":[234],"more":[236,274,289],"efficient":[237],"approximation":[238,253,294],"schemes":[239],"compromising":[240],"optimality.":[242],"one":[245],"simple":[248],"greedy":[249],"approach":[250],"linear":[252],"ratio.":[254,295],"Interestingly,":[255],"naive":[259],"is,":[262],"enjoys":[265],"significantly":[266],"better":[267,293],"performance":[268],"guarantee":[269],"than":[270,327],"other":[272],"seemingly":[273],"sophisticated":[275],"algorithms.":[276],"Second,":[277],"harnessing":[279],"submodularity":[281],"design":[287],"elaborate":[290],"effectiveness":[297],"proposed":[300,319],"algorithms":[301,320],"justified":[303],"extensive":[305],"simulations":[306],"three":[308],"real":[309],"data":[311],"sets,":[312],"from":[313],"which":[314],"demonstrate":[316],"yield":[321],"strategies":[322],"smaller":[324],"conventional":[328],"heuristics.":[329]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}