{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:19:11Z","timestamp":1774624751367,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0012-365x(98)00175-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:02Z","timestamp":1027609622000},"page":"219-227","source":"Crossref","is-referenced-by-count":12,"title":["Rabin numbers of Butterfly networks"],"prefix":"10.1016","volume":"196","author":[{"given":"Sheng-Chyang","family":"Liaw","sequence":"first","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00175-7_BIB1","article-title":"Fault-tolerant routing in Butterfly networks","author":"Cao","year":"1995"},{"key":"10.1016\/S0012-365X(98)00175-7_BIB2","doi-asserted-by":"crossref","unstructured":"G.J. Chang, F.K. Hwang, L.D. Tong, Characterizing bit permutation networks, Networks, accepted.","DOI":"10.1002\/(SICI)1097-0037(199907)33:4<261::AID-NET3>3.0.CO;2-Q"},{"key":"10.1016\/S0012-365X(98)00175-7_BIB3","series-title":"Graph Theory","author":"Gould","year":"1988"},{"key":"10.1016\/S0012-365X(98)00175-7_BIB4","series-title":"Proc. First Ann. Comput. Architecture Conf.","first-page":"21","article-title":"Banyan networks for partitioning multiprocessing systems","author":"Goke","year":"1973"},{"key":"10.1016\/S0012-365X(98)00175-7_BIB5","unstructured":"F.K. Hwang, S.C. Liaw, H.G. Yeh, Equivalence classes for extra-stage networks, submitted for publication."},{"key":"10.1016\/S0012-365X(98)00175-7_BIB6","first-page":"668","article-title":"On container width and length in graphs, groups, and networks","volume":"E77-A","author":"Hsu","year":"1994","journal-title":"IEICE Trans. Fundam. Electr., Comm. Comput. Sci."},{"key":"10.1016\/S0012-365X(98)00175-7_BIB7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(94)90036-1","article-title":"Note on the k-diameter of k-regular k-connected graphs","volume":"133","author":"Hsu","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00175-7_BIB8","first-page":"35","article-title":"A graph theoretical study of transmission delay and fault tolerance","volume":"16","author":"Hsu","year":"1994","journal-title":"Int. J. Mini Microcomput."},{"key":"10.1016\/S0012-365X(98)00175-7_BIB9","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0898-1221(87)90085-X","article-title":"Fault diameter of interconnection networks","volume":"13","author":"Krishnamoorthy","year":"1987","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0012-365X(98)00175-7_BIB10","article-title":"Generalized Diameters on Networks","author":"Liaw","year":"1998"},{"key":"10.1016\/S0012-365X(98)00175-7_BIB11","doi-asserted-by":"crossref","unstructured":"S.C. Liaw, F. Cao, G.J. Chang, D.F. Hsu, Fault-tolerant routing in circulant networks and cycle prefix networks, Annals of Comb. (to appear).","DOI":"10.1007\/BF01608486"},{"key":"10.1016\/S0012-365X(98)00175-7_BIB12","unstructured":"S.C. Liaw, G.J. Chang, Generalized diameters and Rabin numbers of networks, J. Comb. Optimization (to appear)."},{"key":"10.1016\/S0012-365X(98)00175-7_BIB13","doi-asserted-by":"crossref","unstructured":"S.C. Liaw, G.J. Chang, Wide diameters of Butterfly networks, Taiwanese J. Math. (to appear).","DOI":"10.11650\/twjm\/1500407056"},{"key":"10.1016\/S0012-365X(98)00175-7_BIB14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","article-title":"Efficient dispersal of information for security, load balancing, and fault tolerance","volume":"36","author":"Rabin","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"issue":"8","key":"10.1016\/S0012-365X(98)00175-7_BIB15","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TC.1980.1675651","article-title":"On a class of multistage interconnection networks","volume":"C-29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001757?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001757?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:28:40Z","timestamp":1555968520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0012365X98001757"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00175-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}