Loopless Generation of Schroder Trees TeX Export

@article{citeulike:5980429, abstract = {The well-known Schroder numbers have appeared in different combinatorial contexts, including Schroder trees and well-weighted binary trees. The only loopless algorithm for generating Schroder trees actually generated representations for their well-weighted binary tree counterparts. This paper presents the first loopless algorithms for directly generating Schroder tree representations. They use a new loopless algorithm for generating \$k\$-compositions of \$n\$ in inverse lexicographic order. 10.1093/comjnl/46.1.106}, author = {Korsh, James F. and LaFollette, Paul S.}, citeulike-article-id = {5980429}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/comjnl/46.1.106}, citeulike-linkout-1 = {http://comjnl.oxfordjournals.org/content/46/1/106.abstract}, citeulike-linkout-2 = {http://comjnl.oxfordjournals.org/content/46/1/106.full.pdf}, day = {1}, doi = {10.1093/comjnl/46.1.106}, journal = {The Computer Journal}, keywords = {combinatorics}, month = {January}, number = {1}, pages = {106--113}, posted-at = {2009-10-21 13:58:00}, priority = {2}, title = {Loopless Generation of Schroder Trees}, url = {http://dx.doi.org/10.1093/comjnl/46.1.106}, volume = {46}, year = {2003} }

TY - JOUR ID - citeulike:5980429 L3 - citeulike-article-id:5980429 N2 - The well-known Schroder numbers have appeared in different combinatorial contexts, including Schroder trees and well-weighted binary trees. The only loopless algorithm for generating Schroder trees actually generated representations for their well-weighted binary tree counterparts. This paper presents the first loopless algorithms for directly generating Schroder tree representations. They use a new loopless algorithm for generating $k$-compositions of $n$ in inverse lexicographic order. 10.1093/comjnl/46.1.106 IS - 1 JF - The Computer Journal EP - 113 TI - Loopless Generation of Schroder Trees VL - 46 SP - 106 KW - combinatorics AU - Korsh, James AU - LaFollette, Paul PY - 2003/01/01/ UR - http://dx.doi.org/10.1093/comjnl/46.1.106 ER -