{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:05Z","timestamp":1725567065922},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_58","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"570-576","source":"Crossref","is-referenced-by-count":3,"title":["Generating Combinations by Prefix Shifts"],"prefix":"10.1007","author":[{"given":"Frank","family":"Ruskey","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/71.159045","volume":"3","author":"P.F. Corbett","year":"1992","unstructured":"Corbett, P.F.: Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks. IEEE Transactions on Parallel and Distributed Systems\u00a03, 622\u2013626 (1992)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"58_CR2","first-page":"215","volume":"69","author":"P.J. Chase","year":"1989","unstructured":"Chase, P.J.: Combination Generation and Graylex Ordering. Congressus Numerantium\u00a069, 215\u2013242 (1989)","journal-title":"Congressus Numerantium"},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF00156752","volume":"4","author":"P. Diaconis","year":"1994","unstructured":"Diaconis, P., Holmes, S.: Gray codes for randomization procedures. Statistical Computing\u00a04, 207\u2013302 (1994)","journal-title":"Statistical Computing"},{"key":"58_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2422.322413","volume":"31","author":"P. Eades","year":"1984","unstructured":"Eades, P., Hickey, M., Read, R.: Some Hamilton Paths and a Minimal Change Algorithm. Journal of the ACM\u00a031, 19\u201329 (1984)","journal-title":"Journal of the ACM"},{"key":"58_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","volume":"19","author":"P. Eades","year":"1984","unstructured":"Eades, P., McKay, B.: An Algorithm for Generating Subsets of Fixed Size with a Strong Minimal Change Property. Information Processing Letters\u00a019, 131\u2013133 (1984)","journal-title":"Information Processing Letters"},{"key":"58_CR6","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G. Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless Algorithms for Generating Permutations, Combinations and Other Combinatorial Configurations. Journal of the ACM\u00a020, 500\u2013513 (1973)","journal-title":"Journal of the ACM"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(94)90023-X","volume":"133","author":"M. Jiang","year":"1994","unstructured":"Jiang, M., Ruskey, F.: Determining the Hamilton-connectedness of certain vertex-transitive graphs. Discrete Mathematics\u00a0133, 159\u2013170 (1994)","journal-title":"Discrete Mathematics"},{"key":"58_CR8","first-page":"61","volume-title":"The Art of Computer Programming, pre-fascicle 4A (a draft of Section 7.2.1.3: Generating all Combinations)","author":"D.E. Knuth","year":"2004","unstructured":"Knuth, D.E.: The Art of Computer Programming, pre-fascicle 4A (a draft of Section 7.2.1.3: Generating all Combinations), p. 61. Addison-Wesley, Reading (2004), \n                    \n                      http:\/\/www-cs-faculty.stanford.edu\/~knuth\/fasc3a.ps.gz"},{"key":"58_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-57568-5_250","volume-title":"Algorithms and Computation","author":"F. Ruskey","year":"1993","unstructured":"Ruskey, F.: Simple combinatorial Gray codes constructed by reversing sublists. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 201\u2013208. Springer, Heidelberg (1993)"},{"key":"58_CR10","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/T-C.1973.223681","volume":"22","author":"D.T. Tang","year":"1973","unstructured":"Tang, D.T.: C.N. Liu Distance-2 Cycle Chaining of Constant Weight Codes. IEEE Transactions C-22, 176\u2013180 (1973)","journal-title":"IEEE Transactions C-"},{"key":"58_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4968-9","volume-title":"Constructive Combinatorics","author":"D. Stanton","year":"1986","unstructured":"Stanton, D., White, D.: Constructive Combinatorics. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T04:13:14Z","timestamp":1553141594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11533719_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}