{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T13:24:07Z","timestamp":1744377847142},"reference-count":104,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":[[1993,4]]},"DOI":"10.1016\/0167-8191(93)90054-o","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"361-407","source":"Crossref","is-referenced-by-count":245,"title":["Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey"],"prefix":"10.1016","volume":"19","author":[{"given":"S","family":"Lakshmivarahan","sequence":"first","affiliation":[]},{"given":"Jung-Sing","family":"Jwo","sequence":"additional","affiliation":[]},{"given":"S.K","family":"Dhall","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90054-O_BIB1","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"393","article-title":"The Star-Graph: An attractive alternative to the n-cube","author":"Akers","year":"1987"},{"key":"10.1016\/0167-8191(93)90054-O_BIB2","series-title":"Proc. Fourteenth Internat. Conf. on Fault-Tolerant Computing","first-page":"422","article-title":"Group graphs as interconnection networks","author":"Akers","year":"1984"},{"key":"10.1016\/0167-8191(93)90054-O_BIB3","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group-theoretic model for symmetric interconnection networks","volume":"38","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB4","series-title":"Proc. 22nd Annual Conf. on Information Science","article-title":"A reduced mesh of trees organization for efficient solution to graph problems","author":"Alnuweiri","year":"1988"},{"issue":"10","key":"10.1016\/0167-8191(93)90054-O_BIB5","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1109\/31.44352","article-title":"Optimal image computations on reduced VLSI architectures","volume":"36","author":"Alnuweri","year":"1989","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0167-8191(93)90054-O_BIB6","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1137\/0219037","article-title":"Group action graphs and parallel architectures","volume":"19","author":"Annexstein","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB7","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1109\/26.111428","article-title":"Representation and routing of Cayley graphs","volume":"39","author":"Arden","year":"1991","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0167-8191(93)90054-O_BIB8","series-title":"Algebraic Combinatorics I: Association Schemes, Benjamin\/Cummings Lecture Notes Series 58","author":"Bannai","year":"1984"},{"issue":"2","key":"10.1016\/0167-8191(93)90054-O_BIB9","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TC.1977.5009297","article-title":"The multidimensional access memory in STARAN","volume":"C-26","author":"Batcher","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB10","series-title":"Proc. Symp. Computer Architecture","first-page":"108","article-title":"The GF-11 Supercomputer","author":"Beetem","year":"1985"},{"key":"10.1016\/0167-8191(93)90054-O_BIB11","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1002\/j.1538-7305.1962.tb03990.x","article-title":"On rearrangeable three-stage connecting networks","volume":"41","author":"Benes","year":"1962","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0167-8191(93)90054-O_BIB12","series-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"Benes","year":"1965"},{"key":"10.1016\/0167-8191(93)90054-O_BIB13","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1002\/j.1538-7305.1975.tb02844.x","article-title":"Applications of group theory to connecting networks","volume":"54","author":"Benes","year":"1975","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0167-8191(93)90054-O_BIB14","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1002\/j.1538-7305.1975.tb02845.x","article-title":"Proving the rearrangeability of connecting networks by group calculations","volume":"54","author":"Benes","year":"1975","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0167-8191(93)90054-O_BIB15","first-page":"797","article-title":"Towards a group theoretic proof of the rearrangeability theorem for Clos' network","volume":"55","author":"Benes","year":"1975","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0167-8191(93)90054-O_BIB16","series-title":"Principles of Combinatorics","author":"Berge","year":"1971"},{"key":"10.1016\/0167-8191(93)90054-O_BIB17","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","article-title":"Strategies for interconnection networks: Some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB18","article-title":"Shortest paths in orthogonal graphs","author":"Bhatia","year":"1991"},{"key":"10.1016\/0167-8191(93)90054-O_BIB19","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","article-title":"Generalized Hypercube and Hyperbus structures for a computer network","volume":"33","author":"Bhuyan","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB20","series-title":"Finite Groups of Automorphisms","author":"Biggs","year":"1971"},{"key":"10.1016\/0167-8191(93)90054-O_BIB21","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/0167-8191(93)90054-O_BIB22","series-title":"Permutation Groups and Combinatorical Structures","author":"Biggs","year":"1979"},{"key":"10.1016\/0167-8191(93)90054-O_BIB23","article-title":"Algorithms for permutation groups and Cayley networks","author":"Blaha","year":"1989"},{"key":"10.1016\/0167-8191(93)90054-O_BIB24","series-title":"Distance-Regular Graphs","author":"Brouwer","year":"1989"},{"key":"10.1016\/0167-8191(93)90054-O_BIB25","series-title":"Graph Theory with Applications","author":"Bondy","year":"1977"},{"key":"10.1016\/0167-8191(93)90054-O_BIB26","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1214\/aoms\/1177706356","article-title":"On linear associative algebras corresponding to association schemes of partially balanced designs","volume":"30","author":"Bose","year":"1959","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/0167-8191(93)90054-O_BIB27","article-title":"Supertoroids, FFT butterflies, and cube-connected-cycles","author":"Buell","year":"1991"},{"key":"10.1016\/0167-8191(93)90054-O_BIB28","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/12.123397","article-title":"Small diameter symmetric networks from linear groups","volume":"41","author":"Campbell","year":"1992","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/0167-8191(93)90054-O_BIB29","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TC.1985.1676627","article-title":"Interconnection networks based on generalization of cube-connected cycles","volume":"C-34","author":"Carlsson","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB30","article-title":"Regular graphs with small diameter as models for interconnection networks","author":"Chudnovsky","year":"1988","journal-title":"IBM Technical Report RC-13484"},{"key":"10.1016\/0167-8191(93)90054-O_BIB31","first-page":"295","article-title":"Diameters of graphs: Old problems and new results","volume":"60","author":"Chung","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0167-8191(93)90054-O_BIB32","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","article-title":"A study of non-blocking switching networks","volume":"32","author":"Clos","year":"1953","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0167-8191(93)90054-O_BIB33","series-title":"Generators and Relations for Discrete Groups","author":"Coxeter","year":"1980"},{"key":"10.1016\/0167-8191(93)90054-O_BIB34","series-title":"Proc. Internat. Conf. Parallel Processing","first-page":"531","article-title":"Performance measurements on a 128-node butterfly parallel processor","author":"Crowther","year":"1985"},{"key":"10.1016\/0167-8191(93)90054-O_BIB35","article-title":"An algebraic approach to the association schemes of coding theory","volume":"Vol. 10","author":"Delsarte","year":"1973","journal-title":"Phillips Research Reports Supplement"},{"key":"10.1016\/0167-8191(93)90054-O_BIB36","series-title":"Proc. First IEEE Symp. Parallel and Distributed Computing","first-page":"210","article-title":"Simulation of binary trees and X-trees on pyramid networks","author":"Dingle","year":"1989"},{"key":"10.1016\/0167-8191(93)90054-O_BIB37","series-title":"Proc. First IEEE Symp. Parallel and Distributed Computing","first-page":"220","article-title":"Efficient uses of pyramid networks","author":"Dingle","year":"1989"},{"key":"10.1016\/0167-8191(93)90054-O_BIB38","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54522-0_104","article-title":"Algebraic construction of efficient broadcast networks","author":"Dinneen","year":"1991"},{"key":"10.1016\/0167-8191(93)90054-O_BIB39","article-title":"An overview of supertoridal networks","author":"Draper","year":"1991"},{"issue":"1","key":"10.1016\/0167-8191(93)90054-O_BIB40","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.80187","article-title":"Properties and performance of folded hypercubes","volume":"2","author":"El-Amawy","year":"1991","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"10.1016\/0167-8191(93)90054-O_BIB41","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0196-6774(81)90029-8","article-title":"The minimal-length generating sequence problem is NP-hard","volume":"2","author":"Even","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-8191(93)90054-O_BIB42","article-title":"Global communication algorithms for Hypercubes and other Cayley coset graphs","author":"Faber","year":"1987"},{"key":"10.1016\/0167-8191(93)90054-O_BIB43","article-title":"High-degree low-diameter interconnection networks with vertex symmetry: The direct case","author":"Faber","year":"1988"},{"key":"10.1016\/0167-8191(93)90054-O_BIB44","article-title":"Symmetries in graphs: An annotated bibliography","author":"Fuller","year":"1986"},{"key":"10.1016\/0167-8191(93)90054-O_BIB45","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","article-title":"Bounds for sorting by prefix reversal","volume":"27","author":"Gates","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0167-8191(93)90054-O_BIB46","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(93)90054-O_BIB47","article-title":"A class fault-tolerant multiprocessor network","author":"Ghafoor","year":"1988"},{"issue":"2","key":"10.1016\/0167-8191(93)90054-O_BIB48","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/12.73594","article-title":"A study of odd graphs as fault-tolerant interconnection networks","volume":"40","author":"Ghafoor","year":"1991","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/0167-8191(93)90054-O_BIB49","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1109\/12.35837","article-title":"Bisectional fault-tolerant communication architecture for super-computer systems","volume":"38","author":"Ghafoor","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB50","first-page":"176","article-title":"Distance-transitive graphs for fault-tolerant multiprocessor systems","volume":"1","author":"Ghafoor","year":"1989"},{"key":"10.1016\/0167-8191(93)90054-O_BIB51","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jgt.3190150204","article-title":"Updating the Hamiltonian problem - A survey","volume":"15","author":"Gould","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/0167-8191(93)90054-O_BIB52","article-title":"The cost of broadcasting on Star graphs and k-ary Hypercubes","author":"Graham","year":"1988"},{"key":"10.1016\/0167-8191(93)90054-O_BIB53","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0167-8191(93)90054-O_BIB54","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0167-8191(93)90054-O_BIB55","series-title":"Probabilistic Analysis of Algorithms","author":"Hofri","year":"1987"},{"key":"10.1016\/0167-8191(93)90054-O_BIB56","first-page":"1348","article-title":"Advanced parallel processing with supercomputer architectures","volume":"75","author":"Hwang","year":"1987"},{"key":"10.1016\/0167-8191(93)90054-O_BIB57","series-title":"Computer Architecture and Parallel Processing","author":"Hwang","year":"1984"},{"issue":"1","key":"10.1016\/0167-8191(93)90054-O_BIB58","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/12.8729","article-title":"An orthogonal multiprocessor for large-grain scientific computations","volume":"C-38","author":"Hwang","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB59","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","article-title":"The complexity of finding minimal-length generating sequence","volume":"36","author":"Jerrum","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-8191(93)90054-O_BIB60","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Spanning graphs for optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB61","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1142\/S0218126691000215","article-title":"Embedding of cycles and grids in star graphs","volume":"1","author":"Jwo","year":"1991","journal-title":"J. Circuits Syst. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB62","series-title":"Proc. Fifth Internat. Parallel Processing Symp.","first-page":"404","article-title":"Characterization of node disjoint (parallel) paths in Star graphs","author":"Jwo","year":"1991"},{"key":"10.1016\/0167-8191(93)90054-O_BIB63","doi-asserted-by":"crossref","unstructured":"J. Jwo, S. Lakshmivarahan and S.K. Dhall, A new class of interconnection networks based on the alternating group, Network, submitted.","DOI":"10.1109\/SPDP.1992.242706"},{"key":"10.1016\/0167-8191(93)90054-O_BIB64","article-title":"Analysis of interconnection networks based on Cayley graphs related to permutation groups","author":"Jwo","year":"1991"},{"key":"10.1016\/0167-8191(93)90054-O_BIB65","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0065-2458(08)60007-8","article-title":"Multistage interconnection networks for multiprocessor systems","volume":"26","author":"Kothari","year":"1987","journal-title":"Adv. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB66","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":"Krishnamoorthi","year":"1987","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0167-8191(93)90054-O_BIB67","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00127849","article-title":"A new hierarchy of hypercube interconnection schemes for parallel computers","volume":"2","author":"Lakshmivarahan","year":"1988","journal-title":"J. Supercomput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB68","series-title":"Analysis and Design of Parallel Algorithms","author":"Lakshmivarahan","year":"1990"},{"key":"10.1016\/0167-8191(93)90054-O_BIB69","first-page":"1145","article-title":"Access and alignment of data in an array processor","volume":"24","author":"Lawrie","year":"1975-1987"},{"key":"10.1016\/0167-8191(93)90054-O_BIB70","series-title":"Introduction to the Theory of Finite Groups","author":"Ledermann","year":"1949"},{"key":"10.1016\/0167-8191(93)90054-O_BIB71","series-title":"Parallel Computing: Theory and Comparisons","author":"Lipovski","year":"1987"},{"key":"10.1016\/0167-8191(93)90054-O_BIB72","article-title":"Lectures on polynomial-time computation in groups","author":"Luks","year":"1990"},{"key":"10.1016\/0167-8191(93)90054-O_BIB73","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"key":"10.1016\/0167-8191(93)90054-O_BIB74","article-title":"Broadcasting on three multiprocessor interconnection topologies","author":"Mackenzie","year":"1989"},{"key":"10.1016\/0167-8191(93)90054-O_BIB75","volume":"Vol. 16","author":"Macwilliams","year":"1978"},{"key":"10.1016\/0167-8191(93)90054-O_BIB76","series-title":"Proc. Fifth Internat. Parallel Processing Symp.","first-page":"432","article-title":"A note on orthogonal graphs","author":"Madabhushi","year":"1991"},{"key":"10.1016\/0167-8191(93)90054-O_BIB77","series-title":"Combinatorial Group Theory","author":"Magnus","year":"1976"},{"key":"10.1016\/0167-8191(93)90054-O_BIB78","article-title":"The parallel complexity of abelian permutation group problems","author":"McKenzie","year":"1985"},{"key":"10.1016\/0167-8191(93)90054-O_BIB79","series-title":"Embedding Hamiltonians and Hypercubes in Star graphs","author":"Nigam","year":"1989"},{"issue":"5","key":"10.1016\/0167-8191(93)90054-O_BIB80","doi-asserted-by":"crossref","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"},{"key":"10.1016\/0167-8191(93)90054-O_BIB81","article-title":"Embedding meshes on the star graphs","author":"Ranka","year":"1989"},{"key":"10.1016\/0167-8191(93)90054-O_BIB82","series-title":"Graph Theoretic Concepts in Computer Science","first-page":"150","article-title":"Issues in the study of graph embedding","volume":"Vol. 100","author":"Rosenberg","year":"1981"},{"key":"10.1016\/0167-8191(93)90054-O_BIB83","article-title":"Topological properties of Hypercubes","author":"Saad","year":"1985"},{"key":"10.1016\/0167-8191(93)90054-O_BIB84","article-title":"Data communication in Hypercubes","author":"Saad","year":"1985"},{"key":"10.1016\/0167-8191(93)90054-O_BIB85","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BF01304186","article-title":"Vertex transitive graphs","volume":"68","author":"Sabiduissi","year":"1964","journal-title":"Monatsh. Math."},{"issue":"4","key":"10.1016\/0167-8191(93)90054-O_BIB86","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1109\/12.21149","article-title":"The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI","volume":"38","author":"Samatham","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB87","article-title":"A theory for the description and analysis of a class of interconnection networks","author":"Scherson","year":"1989"},{"key":"10.1016\/0167-8191(93)90054-O_BIB88","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/71.80185","article-title":"Orthogonal graphs for the construction of a class of interconnection networks","volume":"2","author":"Scherson","year":"1991","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"10.1016\/0167-8191(93)90054-O_BIB89","series-title":"Introduction to Group Theory","author":"Schwerdtfeger","year":"1976"},{"key":"10.1016\/0167-8191(93)90054-O_BIB90","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The cosmic cubes","volume":"28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(93)90054-O_BIB91","series-title":"Interconnection Networks for Large-Scale Parallel Processing","author":"Siegel","year":"1985"},{"key":"10.1016\/0167-8191(93)90054-O_BIB92","series-title":"Computational Problems in Abstract Algebra","first-page":"169","article-title":"Computational methods in the study of permutation groups","author":"Sims","year":"1970"},{"key":"10.1016\/0167-8191(93)90054-O_BIB93","first-page":"191","article-title":"Determining the conjugacy classes of a permutation group","volume":"Vol. 4","author":"Sims","year":"1970"},{"key":"10.1016\/0167-8191(93)90054-O_BIB94","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with perfect shuffle","volume":"20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB95","article-title":"Dense symmetric interconnection networks","author":"Tang","year":"1991"},{"key":"10.1016\/0167-8191(93)90054-O_BIB96","series-title":"Distributed Processor Communication Architecture","author":"Thurber","year":"1979"},{"key":"10.1016\/0167-8191(93)90054-O_BIB97","article-title":"Connectivity in graphs","volume":"15","author":"Tutte","year":"1966"},{"key":"10.1016\/0167-8191(93)90054-O_BIB98","series-title":"Algorithms, Structured Computer Arrays and Networks","author":"Uhr","year":"1984"},{"key":"10.1016\/0167-8191(93)90054-O_BIB99","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","article-title":"Connectivity of transitive graphs","volume":"8","author":"Watkins","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0167-8191(93)90054-O_BIB100","article-title":"Graphs, Groups and Surfaces","volume":"8","author":"White","year":"1984","journal-title":"North-Holland Mathematics Studies"},{"key":"10.1016\/0167-8191(93)90054-O_BIB101","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(84)90010-4","article-title":"A survey: Hamiltonian cycles in Cayley graphs","volume":"51","author":"Witte","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0167-8191(93)90054-O_BIB102","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TC.1980.1675651","article-title":"On a class of multistage interconnection networks","volume":"29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB103","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TC.1980.1675679","article-title":"The reverse-exchange interconnection network","volume":"29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90054-O_BIB104","series-title":"London Math. Soc. Lecture Notes Ser. 108","article-title":"Some topics in graph theory","author":"Yap","year":"1986"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390054O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390054O?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:27:45Z","timestamp":1551086865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390054O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":104,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["016781919390054O"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90054-o","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}