乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:46:49Z","timestamp":1648799209262},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0167-8191(89)90095-1","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"375-385","source":"Crossref","is-referenced-by-count":4,"title":["Graph theoretic characterization and reliability of the generalized Boolean n-cube network"],"prefix":"10.1016","volume":"12","author":[{"given":"Tsung-Chuan","family":"Huang","sequence":"first","affiliation":[]},{"given":"Jhing-Fa","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chu-Sing","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jau-Yien","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(89)90095-1_BIB1","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/TC.1981.1675844","article-title":"Fault diagnosis in a Boolean n-cube array of microprocessors","volume":"30","author":"Armstrong","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230150210","article-title":"Combinatorial optimization problems in the analysis and design of probabilistic networks","volume":"15","author":"Bauer","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0167-8191(89)90095-1_BIB3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","article-title":"Generalized hypercube and hyperbus structures for a computer networks","volume":"33","author":"Bhuyan","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB4","series-title":"Algebraic Group Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/0167-8191(89)90095-1_BIB5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/TR.1971.5216111","article-title":"A computerized algorithm for determining the reliability of redundant configurations","volume":"20","author":"Brown","year":"1971","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0167-8191(89)90095-1_BIB6","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.1109\/12.5998","article-title":"Modified mesh-connected parallel computers","volume":"37","author":"Carlson","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB7","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1109\/TC.1986.1676698","article-title":"Multigrid algorithms on the hypercube multiprocessor","volume":"35","author":"Chan","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB8","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1109\/TC.1985.1676641","article-title":"Doubly linked ring networks","volume":"34","author":"Du","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB9","series-title":"Proc. 3rd Ann. Princeton Conf. Information Science and System","first-page":"1","article-title":"Maximally reliable node weighted graphs","author":"Frank","year":"1969"},{"key":"10.1016\/0167-8191(89)90095-1_BIB10","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0167-8191(89)90095-1_BIB11","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1985.1676608","article-title":"A regular fault-tolerant architecture for interconnection networks","volume":"34","author":"Hawkes","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/0167-8191(89)90095-1_BIB12","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/0898-1221(88)90007-7","article-title":"The number of spanning trees of the generalized Boolean n-cube network","volume":"16","author":"Huang","year":"1988","journal-title":"J. Comput. Math. Appl."},{"key":"10.1016\/0167-8191(89)90095-1_BIB13","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/12.4611","article-title":"Incomplete hypercube","volume":"37","author":"Katseff","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB14","first-page":"444","article-title":"Connectivity of probabilistic networks","volume":"3","author":"Kel'mans","year":"1967","journal-title":"Automat. Remote Control."},{"key":"10.1016\/0167-8191(89)90095-1_BIB15","series-title":"Proc. 7th Int. Symp. Comput. Arch.","first-page":"23","article-title":"Distributed fault tolerance for large multi-processor systems","author":"Kuhl","year":"1980"},{"key":"10.1016\/0167-8191(89)90095-1_BIB16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","article-title":"Reliable circuits using less reliable relays","volume":"262","author":"Moore","year":"1956","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0167-8191(89)90095-1_BIB17","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/TC.1982.1676004","article-title":"Optimal BPC permutations on a cube connected SIMD computer","volume":"31","author":"Nassimi","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/TC.1985.1676513","article-title":"Fault-tolerant multiprocessor link and bus network architecture","volume":"34","author":"Pradhan","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB19","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1109\/TC.1982.1676101","article-title":"A fault-tolerant communication architecture for distributed systems","volume":"31","author":"Pradhan","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB20","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube connected cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/0167-8191(89)90095-1_BIB21","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1986.1676763","article-title":"Fault-tolerant multiprocessors with redundant -path interconnection networks","volume":"35","author":"Raghavendra","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB23","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/TC.1984.5009335","article-title":"Shufling with the Illiac and PM21 SIMD networks","volume":"33","author":"Seban","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB24","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/TC.1987.1676947","article-title":"On an optimally fault-tolerant multiprocessor network architecture","volume":"36","author":"Sengupta","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB25","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0016-0032(70)90287-5","article-title":"Construction of redundant networks with minimum distance","volume":"289","author":"Steffen","year":"1970","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0167-8191(89)90095-1_BIB26","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."},{"key":"10.1016\/0167-8191(89)90095-1_BIB27","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TCOM.1972.1091214","article-title":"Analysis and design of reliable computer networks","volume":"20","author":"Wilkov","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB28","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/TCOM.1963.1088748","article-title":"The design of survivable communication network","volume":"11","author":"Williams","year":"1963","journal-title":"IEEE Trans. Comm. Systems"},{"key":"10.1016\/0167-8191(89)90095-1_BIB29","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TC.1981.1675774","article-title":"Communication structures for large networks of microprocessors","volume":"30","author":"Wittie","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90095-1_BIB30","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/31.7582","article-title":"Graph theoretic reliability analysis for the Boolean n-cube network","volume":"35","author":"Yang","year":"1988","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0167-8191(89)90095-1_BIB31","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1093\/comjnl\/31.4.304","article-title":"Analysis of reliability models for interconnecting MIMD system","volume":"31","author":"Zaki","year":"1988","journal-title":"Comput. J."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900951?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900951?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:18Z","timestamp":1551086718000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0167819189900951"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90095-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}