{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:49:59Z","timestamp":1720658999290},"reference-count":33,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p>The conditional diagnosability is an important measure of reliability of interconnection networks. Much progress has been made in the past decade. By consolidating various results, a general scheme can be developed to solve the conditional diagnosability problem for many important classes of interconnection networks; thus eliminating various ad-hoc methods used in earlier studies. The buttery network is an important interconnection network and it has been rediscovered multiple times by different authors. The hyper-buttery network is a graph that amalgamates the buttery network and the hypercube. In this paper, we solve the conditional diagnosability problem for these hyper-buttery networks and their generalizations.<\/jats:p>","DOI":"10.1142\/s0129626416500055","type":"journal-article","created":{"date-parts":[[2016,3,28]],"date-time":"2016-03-28T06:05:18Z","timestamp":1459145118000},"page":"1650005","source":"Crossref","is-referenced-by-count":5,"title":["On the Conditional Diagnosability of Hyper-Buttery Graphs and Related Networks"],"prefix":"10.1142","volume":"26","author":[{"given":"Eddie","family":"Cheng","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Qiu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Brock University, St. Catharines, ON, Canada L2S 3A1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhizhang","family":"Shen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Plymouth State University, Plymouth, NH 03264, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,3,27]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2012.735234"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2010.59"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1145\/2348839.2348850"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/71.640022"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.05.034"},{"issue":"2","key":"p_6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1002\/net.20319","volume":"55","author":"Cheng E.","year":"2010","journal-title":"Networks"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265912500077"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.06.008"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.09.008"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1109\/71.737700"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/71.877943"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2011.2170105"},{"key":"p_13","author":"Hsieh S.-Y.","journal-title":"IEEE Transactions on Computers, to appear."},{"key":"p_14","author":"Hsieh S.-Y.","journal-title":"IEEE Transactions on Computers, to appear."},{"key":"p_15","first-page":"269","volume":"1","author":"Hsu G.-H.","year":"2008","journal-title":"International Computer Symposium"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2008.10.005"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2011.638978"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2008.08.014"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.19"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265908002175"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264748"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1109\/12.177309"},{"key":"p_26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.05.015"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1109\/71.481595"},{"key":"p_30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.01.019"},{"key":"p_31","doi-asserted-by":"publisher","DOI":"10.1080\/00207160410001661726"},{"key":"p_32","doi-asserted-by":"publisher","DOI":"10.1080\/0020716041233127208"},{"key":"p_33","doi-asserted-by":"publisher","DOI":"10.1080\/00207160500113173"},{"key":"p_34","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70769"},{"key":"p_35","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008994"},{"key":"p_36","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.03.021"},{"key":"p_37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.03.010"},{"key":"p_38","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-007-0167-8"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626416500055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T09:15:15Z","timestamp":1718442915000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626416500055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":33,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2016,3,27]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1142\/S0129626416500055"],"URL":"https:\/\/doi.org\/10.1142\/s0129626416500055","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}