{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:54Z","timestamp":1725664554691},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:42Z","timestamp":1330278762000},"page":"263-269","source":"Crossref","is-referenced-by-count":0,"title":["A ranking algorithm for Hamilton paths in shuffle-exchange graphs"],"prefix":"10.1007","author":[{"given":"Fred S.","family":"Annexstein","sequence":"first","affiliation":[]},{"given":"Eugene A.","family":"Kuchko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"F.S. Annexstein (1994): Ranking algorithms for hamiltonian paths in hypercubic networks, to appeal in AMS DIMACS series, Proceedings of the DIMACS Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations.","DOI":"10.1090\/dimacs\/021\/01"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"F.S. Annexstein (1993): Parallel implementations of graph embeddings, in Parallel Architectures and Their Efficient Use, Lecture Notes in Computer Science 678, Springer Verlag, 207\u2013217.","DOI":"10.1007\/3-540-56731-3_20"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"R. Feldmann and P. Mysliwietz (1992): The shuffle exchange network has a Hamiltonian path, Proceedings of 17th Mathematical Foundations of Computer Science (MFCS '92), Lecture Notes in Computer Science 629, Springer Verlag, 246\u2013254.","DOI":"10.1007\/3-540-55808-X_23"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1142\/S0129626492000131","volume":"1","author":"R. Feldmann","year":"1992","unstructured":"R. Feldmann and W. Unger (1992): The cube-connected cycles network is a subgraph of the butterfly network. Parallel Processing Letters (2), 1, 13\u201319.","journal-title":"Parallel Processing Letters (2)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/BF01759059","volume":"6","author":"D.M. Gordon","year":"1991","unstructured":"D.M. Gordon (1991): Parallel sorting on Cayley graphs. Algorithmica (6), 554\u2013564.","journal-title":"Algorithmica"},{"key":"23_CR6","unstructured":"F. Gray (1953): Pulse code communication, U.S. Patent Number 2,632,058."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"H.S. Wilf (1989): Combinatorial algorithms: an update, CBMS-55, SIAM.","DOI":"10.1137\/1.9781611970166"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:11Z","timestamp":1605646571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}