{"id":"https://openalex.org/W2141972123","doi":"https://doi.org/10.1142/s1793830911001371","title":"A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES","display_name":"A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2141972123","doi":"https://doi.org/10.1142/s1793830911001371","mag":"2141972123"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830911001371","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830911001371","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5040625828","display_name":"Wei Ding","orcid":"https://orcid.org/0000-0002-4353-5385"},"institutions":[{"id":"https://openalex.org/I4210119683","display_name":"Zhejiang Water Conservancy and Hydropower Survey and Design Institute","ror":"https://ror.org/02n6dhr29","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210119683"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"WEI DING","raw_affiliation_strings":["Zhejiang Water Conservancy and Hydropower College, Hangzhou, Zhejiang, 310018, P. R. China"],"affiliations":[{"raw_affiliation_string":"Zhejiang Water Conservancy and Hydropower College, Hangzhou, Zhejiang, 310018, P. R. China","institution_ids":["https://openalex.org/I4210119683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"GUOLIANG XUE","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-8809, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-8809, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040625828"],"corresponding_institution_ids":["https://openalex.org/I4210119683"],"apc_list":null,"apc_paid":null,"fwci":0.6277,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70876911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"03","issue":"04","first_page":"503","last_page":"516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.7300463318824768},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7025007605552673},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5732370615005493},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5403772592544556},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.5214571356773376},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5035495162010193},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4512183666229248},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4388655126094818},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43774348497390747},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4033265709877014},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3398648500442505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24551334977149963},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16142621636390686},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12167572975158691},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08997830748558044}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.7300463318824768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7025007605552673},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5732370615005493},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5403772592544556},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.5214571356773376},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5035495162010193},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4512183666229248},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4388655126094818},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43774348497390747},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4033265709877014},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3398648500442505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24551334977149963},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16142621636390686},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12167572975158691},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08997830748558044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830911001371","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830911001371","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1479863711","https://openalex.org/W1481156553","https://openalex.org/W1484040084","https://openalex.org/W1968685726","https://openalex.org/W1980214479","https://openalex.org/W1996969231","https://openalex.org/W2025973739","https://openalex.org/W2033350906","https://openalex.org/W2043520568","https://openalex.org/W2072715079","https://openalex.org/W2117889403","https://openalex.org/W2119252805","https://openalex.org/W2134771798","https://openalex.org/W2147014181","https://openalex.org/W2170637810","https://openalex.org/W2400704561","https://openalex.org/W3141776272","https://openalex.org/W4235295823"],"related_works":["https://openalex.org/W1992928599","https://openalex.org/W2749663619","https://openalex.org/W2593735092","https://openalex.org/W1977529769","https://openalex.org/W1563510876","https://openalex.org/W2097054405","https://openalex.org/W1971148082","https://openalex.org/W2537700370","https://openalex.org/W1998852263","https://openalex.org/W2036860115"],"abstract_inverted_index":{"Given":[0],"an":[1,31,97,113,129,137,160],"unreliable":[2,130],"communication":[3],"network,":[4,14,125],"we":[5],"seek":[6],"a":[7,48,55,120,155,164],"most":[8],"reliable":[9],"source":[10],"(MRS)":[11],"of":[12,20,29,57,60,84,93,105],"the":[13,17,88,150],"which":[15],"maximizes":[16],"expected":[18],"number":[19],"nodes":[21,143],"that":[22],"are":[23,144],"reachable":[24],"from":[25],"it.":[26],"The":[27],"problem":[28,40],"computing":[30,159],"MRS":[32],"in":[33,41,47,81],"general":[34],"graphs":[35],"is":[36,119],"#P-hard.":[37],"However,":[38],"this":[39],"tree":[42,52,167],"networks":[43],"has":[44,54,96,136],"been":[45],"solved":[46],"linear":[49],"time.":[50],"A":[51],"network":[53,94,132],"weakness":[56],"low":[58],"capability":[59],"failure":[61,78],"tolerance.":[62],"Embedding":[63],"rings":[64],"into":[65],"it":[66,74],"by":[67],"adding":[68],"some":[69],"additional":[70],"certain":[71],"edges":[72],"to":[73,102,146,153,169,174],"can":[75],"enhance":[76],"its":[77,103,171],"tolerance,":[79],"resulting":[80],"another":[82],"class":[83,92],"sparse":[85],"networks,":[86],"called":[87,123],"ring-tree":[89],"networks.":[90],"This":[91,109],"also":[95],"underlying":[98,117],"tree-like":[99],"topology,":[100],"leading":[101],"advantage":[104],"being":[106],"easily":[107],"administrated.":[108],"paper":[110],"concerns":[111],"with":[112],"important":[114],"case":[115],"whose":[116],"topology":[118],"strip":[121],"graph,":[122],"\u03bb\u2013rings":[124,131],"and":[126,162],"focuses":[127],"on":[128],"where":[133],"each":[134],"link":[135],"independent":[138],"operational":[139],"probability":[140],"while":[141],"all":[142],"immune":[145],"failures.":[147],"We":[148],"apply":[149],"Divide-and-Conquer":[151],"approach":[152],"design":[154],"fast":[156],"algorithm":[157],"for":[158],"MRS,":[161],"employ":[163],"binary":[165],"division":[166],"(BDT)":[168],"analyze":[170],"time":[172],"complexity":[173],"be":[175],"[Formula:":[176],"see":[177],"text].":[178]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}