Shifts and loopless generation of k-ary trees. Korsh, J. F. & Lipschutz, S. *Information Processing Letters*, 65(5):235--240, March, 1998. Paper doi abstract bibtex A new shift operation on nodes of k-ary trees which preserves preorder node numbers is introduced. The shift graph SGn, k has as vertices all n-node k-ary trees and edges corresponding to one shift. The graph is proven to have a Hamiltonian path and an algorithm is presented which generates all n-node k-ary trees successively with constant time between them.

@article{ Korsh1998,
abstract = {A new shift operation on nodes of k-ary trees which preserves preorder node numbers is introduced. The shift graph SGn, k has as vertices all n-node k-ary trees and edges corresponding to one shift. The graph is proven to have a Hamiltonian path and an algorithm is presented which generates all n-node k-ary trees successively with constant time between them.},
author = {Korsh, James F. and Lipschutz, Seymour},
doi = {10.1016/S0020-0190(97)00215-9},
file = {:Users/KunihiroWASA/Dropbox/paper/1998/Korsh, Lipschutz, Shifts and loopless generation of k-ary trees, 1998.pdf:pdf},
issn = {00200190},
journal = {Information Processing Letters},
keywords = {Binary trees,Combinatorial algorithms,Combinatorial problems,Data structures,Loopless generation,k-ary trees},
month = {March},
number = {5},
pages = {235--240},
title = {{Shifts and loopless generation of k-ary trees}},
url = {http://www.sciencedirect.com/science/article/pii/S0020019097002159 http://linkinghub.elsevier.com/retrieve/pii/S0020019097002159},
volume = {65},
year = {1998}
}

Downloads: 0

{"_id":"3kaQWPTSzhf5ySbSS","authorIDs":[],"author_short":["Korsh, J.<nbsp>F.","Lipschutz, S."],"bibbaseid":"korsh-lipschutz-shiftsandlooplessgenerationofkarytrees-1998","bibdata":{"abstract":"A new shift operation on nodes of k-ary trees which preserves preorder node numbers is introduced. The shift graph SGn, k has as vertices all n-node k-ary trees and edges corresponding to one shift. The graph is proven to have a Hamiltonian path and an algorithm is presented which generates all n-node k-ary trees successively with constant time between them.","author":["Korsh, James F.","Lipschutz, Seymour"],"author_short":["Korsh, J.<nbsp>F.","Lipschutz, S."],"bibtex":"@article{ Korsh1998,\n abstract = {A new shift operation on nodes of k-ary trees which preserves preorder node numbers is introduced. The shift graph SGn, k has as vertices all n-node k-ary trees and edges corresponding to one shift. The graph is proven to have a Hamiltonian path and an algorithm is presented which generates all n-node k-ary trees successively with constant time between them.},\n author = {Korsh, James F. and Lipschutz, Seymour},\n doi = {10.1016/S0020-0190(97)00215-9},\n file = {:Users/KunihiroWASA/Dropbox/paper/1998/Korsh, Lipschutz, Shifts and loopless generation of k-ary trees, 1998.pdf:pdf},\n issn = {00200190},\n journal = {Information Processing Letters},\n keywords = {Binary trees,Combinatorial algorithms,Combinatorial problems,Data structures,Loopless generation,k-ary trees},\n month = {March},\n number = {5},\n pages = {235--240},\n title = {{Shifts and loopless generation of k-ary trees}},\n url = {http://www.sciencedirect.com/science/article/pii/S0020019097002159 http://linkinghub.elsevier.com/retrieve/pii/S0020019097002159},\n volume = {65},\n year = {1998}\n}","bibtype":"article","doi":"10.1016/S0020-0190(97)00215-9","file":":Users/KunihiroWASA/Dropbox/paper/1998/Korsh, Lipschutz, Shifts and loopless generation of k-ary trees, 1998.pdf:pdf","id":"Korsh1998","issn":"00200190","journal":"Information Processing Letters","key":"Korsh1998","keywords":"Binary trees,Combinatorial algorithms,Combinatorial problems,Data structures,Loopless generation,k-ary trees","month":"March","number":"5","pages":"235--240","title":"Shifts and loopless generation of k-ary trees","type":"article","url":"http://www.sciencedirect.com/science/article/pii/S0020019097002159 http://linkinghub.elsevier.com/retrieve/pii/S0020019097002159","volume":"65","year":"1998","bibbaseid":"korsh-lipschutz-shiftsandlooplessgenerationofkarytrees-1998","role":"author","urls":{"Paper":"http://www.sciencedirect.com/science/article/pii/S0020019097002159 http://linkinghub.elsevier.com/retrieve/pii/S0020019097002159"},"keyword":["Binary trees","Combinatorial algorithms","Combinatorial problems","Data structures","Loopless generation","k-ary trees"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:44.911Z","downloads":0,"keywords":["binary trees","combinatorial algorithms","combinatorial problems","data structures","loopless generation","k-ary trees"],"search_terms":["shifts","loopless","generation","ary","trees","korsh","lipschutz"],"title":"Shifts and loopless generation of k-ary trees","year":1998,"dataSources":["YRMeqhMHoNu9HzJoC"]}