{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:11Z","timestamp":1725490211880},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412557"},{"type":"electronic","value":"9783540409960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40996-3_30","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:17:32Z","timestamp":1188335852000},"page":"350-361","source":"Crossref","is-referenced-by-count":1,"title":["An Intuitive and Effective New Representation for Interconnection Network Structures"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijia","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songqiao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S. B. Akers","year":"1989","unstructured":"S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers 38, (1989), pp. 555\u2013566.","journal-title":"IEEE Transactions on Computers"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/0219037","volume":"19","author":"F. Annexstein","year":"1990","unstructured":"F. Annexstein, M. Baumslag, and A. L. Rosenberg, Group action graphs and parallel architectures, SIAM Journal on Computing 19, (1990), pp. 544\u2013569.","journal-title":"SIAM Journal on Computing"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s002240000098","volume":"31","author":"A. Avior","year":"1998","unstructured":"A. Avior, T. Calamoneri, S. Even, A. Litman, and A. L. Rosenberg, A tight layout of the butter y network, Theory of Computing Systems 31, (1998), pp. 475\u2013488.","journal-title":"Theory of Computing Systems"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/226643.226658","volume":"43","author":"S. N. Bhatt","year":"1996","unstructured":"S. N. Bhatt, F. R. K. Chung, J.-W. Hong, F. T. Leighton, B. Obrenic, A. L. Rosenberg, and E. J. Schwabe, Optimal emulations by butter y-like networks, Journal of ACM 43, (1996), pp. 293\u2013330.","journal-title":"Journal of ACM"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1142\/S0129626498000389","volume":"8","author":"J.-C. Bermond","year":"1998","unstructured":"J-C. Bermond, E. Darrot, O. Delmas, and S. Perennes, Hamilton cycle decomposition of the butter y network, Parallel Processing Letters 8, (1998), pp. 371\u2013385.","journal-title":"Parallel Processing Letters"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1142\/S0129626492000131","volume":"2","author":"R. Feldman","year":"1992","unstructured":"R. Feldman and W. Unger, The cube-connected cycles network is a subgraph of the butter y network, Parallel Processing Letters 2, (1992), pp. 13\u201319.","journal-title":"Parallel Processing Letters"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(98)80001-2","volume":"83","author":"A. Germa","year":"1998","unstructured":"A. Germa, M.-C. Heydemann, and D. Sotteau, Cycles in the cube-connected cycles graph, Discrete Applied Mathematics 83, (1998), pp. 135\u2013155.","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0012-365X(74)90006-5","volume":"9","author":"J. L. Gross","year":"1974","unstructured":"J. L. Gross, Voltage graphs, Discrete Mathematics 9, (1974), pp. 239\u2013246.","journal-title":"Discrete Mathematics"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02090766","volume":"23","author":"D. S. Greenberg","year":"1990","unstructured":"D. S. Greenberg, L. S. Heath, and A. L. Rosenberg, Optimal embeddings of butter y-like graphs in the hypercube, Mathematical Systems Theory 23, (1990), pp. 61\u201377.","journal-title":"Mathematical Systems Theory"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/71.808128","volume":"10","author":"Q.-P. Gu","year":"1999","unstructured":"Q.-P. Gu and S. Peng, Unicast in hypercubes with large number of faulty nodes, IEEE Transactions on Parallel and Distributed Systems 10, (1999), pp. 964\u2013975.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1109\/71.706051","volume":"9","author":"R. Klasing","year":"1998","unstructured":"R. Klasing, Improved compressions of cube-connected cycles networks, IEEE Transactions on Parallel and Distributed Systems 9, (1998), pp. 803\u2013812.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/S0167-8191(99)00069-1","volume":"25","author":"S. Lakshmivarahan","year":"1999","unstructured":"S. Lakshmivarahan and S. K. Dhall, Ring, torus and hypercube architectures\/algorithms for parallel computing, Parallel Computing 25, (1999), pp. 1877\u20131906.","journal-title":"Parallel Computing"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0167-8191(93)90054-O","volume":"19","author":"S. Lakshmivarahan","year":"1993","unstructured":"S. Lakshmivarahan, J.-S. Jwo, and S. K. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey, Parallel Computing 19, (1993), pp. 361\u2013407.","journal-title":"Parallel Computing"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/12.743414","volume":"48","author":"Y.-R. Leu","year":"1999","unstructured":"Y.-R. Leu and S.-Y. Kuo, Distributed fault-tolerant ring embedding and reconfiguration in hypercubes, IEEE Transactions on Computers 48, (1999), pp. 81\u201388.","journal-title":"IEEE Transactions on Computers"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y. Saad","year":"1988","unstructured":"Y. Saad and M. H. Schultz, Topological properties of hypercubes, IEEE Transactions on Computers 37, (1988), pp. 867\u2013872.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40996-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:25:55Z","timestamp":1556803555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40996-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412557","9783540409960"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-40996-3_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}