{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T03:00:15Z","timestamp":1773370815853,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":[[1995,6]]},"DOI":"10.1016\/0167-8191(94)00096-s","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:18:22Z","timestamp":1027639102000},"page":"923-936","source":"Crossref","is-referenced-by-count":58,"title":["On the embedding of cycles in pancake graphs"],"prefix":"10.1016","volume":"21","author":[{"given":"Arkady","family":"Kanevsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"c-38","key":"10.1016\/0167-8191(94)00096-S_BIB1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group-theoretic model for symmetric interconnection networks","volume":"4","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)00096-S_BIB2","article-title":"Building hamiltonian circuits and paths in star graphs","author":"Akl","year":"1990"},{"issue":"4","key":"10.1016\/0167-8191(94)00096-S_BIB3","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0743-7315(87)90018-9","article-title":"On mapping parallel algorithms into parallel architecture","author":"Berman","year":"1987","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(94)00096-S_BIB4","article-title":"Processor Networks and Aspects of the Mapping Problem","volume":"vol. 2","author":"Hilbers","year":"1991"},{"key":"10.1016\/0167-8191(94)00096-S_BIB5","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(94)00096-S_BIB6","author":"Lakshmivarahan","year":"1990"},{"key":"10.1016\/0167-8191(94)00096-S_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(93)90054-O","article-title":"Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey","volume":"19","author":"Lakshmivarahan","year":"1993","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(94)00096-S_BIB8","article-title":"Infromation Dispersal and Parallel Computation","volume":"vol. 3","author":"Lyuu","year":"1992"},{"key":"10.1016\/0167-8191(94)00096-S_BIB9","series-title":"Proc. 19th Int. Conf. on Parallel Processing","first-page":"1","article-title":"An efficient sorting algorithm for the star graph interconnection network","author":"Menn","year":"1990"},{"key":"10.1016\/0167-8191(94)00096-S_BIB10","series-title":"Proc. 19th Int. Conf. on Parallel Processing","first-page":"340","article-title":"Embedding hamiltonians and hypercubes in star interconnection graphs","author":"Nigam","year":"1990"},{"key":"10.1016\/0167-8191(94)00096-S_BIB11","series-title":"Proc. 3rd IEEE Symp. on Parallel and Distributed Processing","first-page":"415","article-title":"Data communication and computational geometry on the star and pancake interconnection networks","author":"Qiu","year":"1991"},{"issue":"3","key":"10.1016\/0167-8191(94)00096-S_BIB12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(91)90107-S","article-title":"Decomposing a star graph into disjoint cycles","volume":"39","author":"Qiu","year":"1991","journal-title":"Informat. Processing Letters"},{"key":"10.1016\/0167-8191(94)00096-S_BIB13","article-title":"The star and pancake interconnection networks: properties and algorithms","author":"Qiu","year":"1992"},{"key":"10.1016\/0167-8191(94)00096-S_BIB14","first-page":"150","article-title":"Issues in the study of graph embedding","volume":"volume LNCS-100","author":"Rosenberg","year":"1981"},{"key":"10.1016\/0167-8191(94)00096-S_BIB15","author":"Tanenbaum","year":"1988"},{"key":"10.1016\/0167-8191(94)00096-S_BIB16","article-title":"Topics in distributed algorithms","volume":"vol. 1","author":"Tel","year":"1991"},{"key":"10.1016\/0167-8191(94)00096-S_BIB17","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BF01937486","article-title":"A new algorithm for generation of permutations","volume":"24","author":"Zaks","year":"1984","journal-title":"BIT"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919400096S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919400096S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T07:00:01Z","timestamp":1555570801000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919400096S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["016781919400096S"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)00096-s","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}