{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:46:50Z","timestamp":1762955210234,"version":"3.41.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["NSC 100-2221-E-006-027-MY3"],"award-info":[{"award-number":["NSC 100-2221-E-006-027-MY3"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:p>\n            A system is\n            <jats:italic>t\/t<\/jats:italic>\n            -diagnosable if, given any collection of test results, the faulty nodes can be isolated to within a set of at most\n            <jats:italic>t<\/jats:italic>\n            nodes provided that the number of faulty nodes does not exceed\n            <jats:italic>t<\/jats:italic>\n            . Given an\n            <jats:italic>N<\/jats:italic>\n            -vertex graph\n            <jats:italic>G<\/jats:italic>\n            that is regular with the common degree\n            <jats:italic>d<\/jats:italic>\n            and has no cycle of three or four vertices, this study shows that\n            <jats:italic>G<\/jats:italic>\n            is\n            <jats:italic>(2d \u2212 2)\/(2d \u2212 2)<\/jats:italic>\n            -diagnosable if\n            <jats:italic>N<\/jats:italic>\n            \u2265 4\n            <jats:italic>d<\/jats:italic>\n            \u2212 30 &gt; 0. Based on this result, the\n            <jats:italic>t\/t<\/jats:italic>\n            -diagnosabilities of several classes of graphs can be computed efficiently.\n          <\/jats:p>","DOI":"10.1145\/2442087.2442091","type":"journal-article","created":{"date-parts":[[2013,4,9]],"date-time":"2013-04-09T12:17:58Z","timestamp":1365509878000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["<i>t\/t<\/i>\n            -Diagnosability of regular graphs under the PMC model"],"prefix":"10.1145","volume":"18","author":[{"given":"Chun-An","family":"Chen","sequence":"first","affiliation":[{"name":"National Cheng Kung University, Taiwan"}]},{"given":"Sun-Yuan","family":"Hsieh","sequence":"additional","affiliation":[{"name":"National Cheng Kung University, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2013,4,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"volume-title":"Proceedings of the International Conference on Parallel Processing. 393--400","author":"Akers S. B.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675844"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676437"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/06065043X"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.44"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675807"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.381950"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676472"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.102840"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.67323"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.722224"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1019858"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.33"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.12.023"},{"volume-title":"Proceedings International Symposium on Fault-Tolerant Computing. 167--170","year":"1975","author":"Friedman A. D.","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1980.1653532"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1674966"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223782"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.30"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230414"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e90-1.1.306"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7906(95)00028-3"},{"volume-title":"Proceedings of the 3rd USA-Japan Computer Conference. 251--257","author":"Kavianpour A.","key":"e_1_2_1_25_1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.73595"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265908002175"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/358645.358660"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264748"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.2234"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.3390\/s110201959"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.536232"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676938"},{"key":"e_1_2_1_34_1","first-page":"1386","article-title":"Enhanced hypercubes","volume":"41","author":"Tzeng N. E.","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.312114"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.817401"},{"key":"e_1_2_1_37_1","unstructured":"West D. B. 2001. Introduction to Graph Theory 2nd Ed. Prentice Hall Upper Saddle River NJ.  West D. B. 2001. Introduction to Graph Theory 2nd Ed. Prentice Hall Upper Saddle River NJ."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676805"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.09.011"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442087.2442091","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2442087.2442091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:25Z","timestamp":1750235725000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442087.2442091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1145\/2442087.2442091"],"URL":"https:\/\/doi.org\/10.1145\/2442087.2442091","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2013,3]]},"assertion":[{"value":"2012-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-04-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}