{"id":"https://openalex.org/W1993709643","doi":"https://doi.org/10.1145/2632951.2632990","title":"Optimal determination of source-destination connectivity in random graphs","display_name":"Optimal determination of source-destination connectivity in random graphs","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W1993709643","doi":"https://doi.org/10.1145/2632951.2632990","mag":"1993709643"},"language":"en","primary_location":{"id":"doi:10.1145/2632951.2632990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2632951.2632990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing","raw_type":"proceedings-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":["Shanghai Jiao Tong University, Shanghai, China","[Shanghai Jiao Tong University, Shanghai, China]"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"[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":["Shanghai Jiao Tong University, Shanghai, China","[Shanghai Jiao Tong University, Shanghai, China]"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"[Shanghai Jiao Tong University, Shanghai, China]","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101852131","display_name":"P. R. Kumar","orcid":"https://orcid.org/0000-0003-0474-080X"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P.R. Kumar","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048486573"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":1.792,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86312462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"214"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.8937627077102661},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7005087733268738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6398419737815857},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.5873177647590637},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5330162644386292},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4951991140842438},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4934207499027252},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4690093696117401},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4565848708152771},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44294169545173645},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.432331383228302},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2810876965522766}],"concepts":[{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.8937627077102661},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7005087733268738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6398419737815857},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.5873177647590637},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5330162644386292},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4951991140842438},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4934207499027252},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4690093696117401},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4565848708152771},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44294169545173645},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.432331383228302},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2810876965522766},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2632951.2632990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2632951.2632990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.709.8771","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.8771","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iwct.sjtu.edu.cn/Personal/xwang8/paper/MobiHoc2014.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W73235108","https://openalex.org/W1918250237","https://openalex.org/W1967533244","https://openalex.org/W2018438786","https://openalex.org/W2046761586","https://openalex.org/W2056986231","https://openalex.org/W2069356492","https://openalex.org/W2088521668","https://openalex.org/W2102041871","https://openalex.org/W2108986762","https://openalex.org/W2112209432","https://openalex.org/W2113233457","https://openalex.org/W2117753105","https://openalex.org/W2126893614","https://openalex.org/W2133678114","https://openalex.org/W2138359578","https://openalex.org/W2156479532","https://openalex.org/W2156549096","https://openalex.org/W2165035730","https://openalex.org/W2169293240","https://openalex.org/W2341140953","https://openalex.org/W2905110430","https://openalex.org/W3143219376","https://openalex.org/W4205104645","https://openalex.org/W4252973173","https://openalex.org/W4312512934","https://openalex.org/W6672547625","https://openalex.org/W6677005949","https://openalex.org/W6793127252"],"related_works":["https://openalex.org/W2781078086","https://openalex.org/W2114952748","https://openalex.org/W2949188444","https://openalex.org/W4229903239","https://openalex.org/W2904025242","https://openalex.org/W3028470672","https://openalex.org/W4298334867","https://openalex.org/W2902202435","https://openalex.org/W1993709643","https://openalex.org/W3015452991"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"the":[3,15,85,147,155,199,205,217],"problem":[4,37],"of":[5,41,47,89,103,140],"optimally":[6],"determining":[7,42],"source-destination":[8],"connectivity":[9,102,228],"in":[10,185],"random":[11,19],"graphs.":[12,261],"We":[13],"consider":[14],"classic":[16],"Erdos-Renyi":[17],"(ER)":[18],"graph":[20,219],"with":[21,33],"$n$":[22],"nodes,":[23,48],"where":[24],"an":[25,80,172],"edge":[26,67,173,249],"independently":[27],"exists":[28,75],"between":[29],"any":[30],"two":[31],"nodes":[32],"probability":[34],"p.":[35],"The":[36,91,143,234,253],"examined":[38],"is":[39,175,236],"that":[40,62,83,174,195],"whether":[43],"a":[44,49,53,59,107,166,178,186,222],"given":[45],"pair":[46],"source":[50],"S":[51,104],"and":[52,105,169],"destination":[54],"D,":[55,106],"are":[56],"connected":[57,163],"by":[58,159],"path.":[60],"Assuming":[61],"at":[63],"each":[64,151,161],"step":[65,152],"one":[66],"can":[68],"be":[69],"tested":[70],"to":[71,100,110,117,124,129,136,165,198,227,246,250,257],"see":[72,118,137],"if":[73,119,138],"it":[74,127,153,193],"or":[76,213],"not,":[77],"we":[78],"determine":[79,247],"optimal":[81,92,144,206],"policy":[82,93,108,145,235],"minimizes":[84],"total":[86],"expected":[87],"number":[88],"steps.":[90],"has":[94,128,146],"several":[95],"interesting":[96],"features.":[97],"In":[98],"order":[99],"establish":[101,125],"needs":[109],"check":[111,130],"all":[112,121,131],"edges":[113,132],"on":[114,133,177,211],"some":[115,134,258],"path":[116,181],"they":[120],"exist,":[122],"but":[123],"disconnectivity":[126,226],"cut":[135],"none":[139],"them":[141],"exists.":[142],"following":[148],"form.":[149],"At":[150],"examines":[154],"condensation":[156],"multigraph":[157],"formed":[158],"contracting":[160],"known":[162],"component":[164],"single":[167],"node,":[168],"then":[170],"checks":[171],"simultaneously":[176],"shortest":[179],"S-D":[180,188],"as":[182,184],"well":[183],"minimum":[187],"cut.":[189],"Among":[190],"such":[191],"edges,":[192],"chooses":[194],"which":[196,248],"leads":[197],"most":[200],"opportunities":[201],"for":[202],"connection.":[203],"Interestingly,":[204],"strategy":[207],"does":[208],"not":[209],"depend":[210],"p":[212,230],"n,":[214],"even":[215],"though":[216],"entire":[218],"itself":[220],"undergoes":[221],"sharp":[223],"transition":[224],"from":[225],"around":[229],"=":[231],"ln":[232],"n/n.":[233],"efficiently":[237],"implementable,":[238],"requiring":[239],"no":[240],"more":[241,259],"than":[242],"30":[243],"log2n":[244],"operations":[245],"test":[251],"next.":[252],"result":[254],"also":[255],"extends":[256],"general":[260]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}