{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:56:29Z","timestamp":1742385389777},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772934"},{"type":"electronic","value":"9783540772941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77294-1_11","type":"book-chapter","created":{"date-parts":[[2007,12,14]],"date-time":"2007-12-14T04:54:07Z","timestamp":1197608047000},"page":"112-130","source":"Crossref","is-referenced-by-count":3,"title":["Combinatorial Algorithms for Listing Paths in Minimal Change Order"],"prefix":"10.1007","author":[{"given":"Zareen","family":"Alamgir","sequence":"first","affiliation":[]},{"given":"Sarmad","family":"Abbasi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Combinatorial Algorithms for Computers and Calculators","author":"A. Nijenhuis","year":"1978","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms for Computers and Calculators. Academic Press, London (1978)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/368637.368660","volume":"8","author":"F.H. Trotter","year":"1962","unstructured":"Trotter, F.H.: Perm (algorithm 115). Communications of the ACM\u00a08, 434\u2013435 (1962)","journal-title":"Communications of the ACM"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/11533719_58","volume-title":"Computing and Combinatorics","author":"F. Ruskey","year":"2005","unstructured":"Ruskey, F., Williams, A.: Generating combinations by prefix shifts. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 570\u2013576. Springer, Heidelberg (2005)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/362604.362608","volume":"14","author":"K. Harada","year":"1971","unstructured":"Harada, K.: Generation of rosary permutations expressed in hamiltonian circuits. Communications of the ACM\u00a014, 373\u2013379 (1971)","journal-title":"Communications of the ACM"},{"key":"11_CR5","volume-title":"Art of Computer Programming","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: Art of Computer Programming, vol.\u00a04. Addison-Wesley, Reading (2005)"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1150334.1150335","volume":"2","author":"J. Korsh","year":"2006","unstructured":"Korsh, J., Lafollette, P.: A loopless gray code for rooted trees. ACM Trans. Algorithms\u00a02(2), 135\u2013152 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1145\/363282.363315","volume":"10","author":"G.G. Langdon","year":"1967","unstructured":"Langdon, G.G.: An algorithm for generating permutations. Communications of the ACM\u00a010, 298\u2013299 (1967)","journal-title":"Communications of the ACM"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C. Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Review\u00a039(4), 605\u2013629 (1997)","journal-title":"SIAM Review"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"282","DOI":"10.2307\/2003846","volume":"17","author":"S.M. Johnson","year":"1963","unstructured":"Johnson, S.M.: Generation of permutations by adjacent transposition. Math. Comp.\u00a017, 282\u2013285 (1963)","journal-title":"Math. Comp."}],"container-title":["Lecture Notes in Computer Science","Combinatorial and Algorithmic Aspects of Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77294-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:07:56Z","timestamp":1619521676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77294-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772934","9783540772941"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77294-1_11","relation":{},"subject":[]}}