@article{Aringhieri2003,
author = "Aringhieri, Roberto and Hansen, Pierre and Malucelli, Federico",
doi = "10.1007/s10288-002-0008-9",
issn = "16194500",
journal = "4OR",
keyword = "Exact enumeration problems,applications,enumeration of graphs and maps,generating functions,trees",
link = "http://link.springer.com/10.1007/s10288-002-0008-9",
month = "mar",
number = "1",
pages = "67--83",
title = "Chemical trees enumeration algorithms",
uri = "http://link.springer.com/10.1007/s10288-002-0008-9",
volume = "1",
year = "2003",
}
@article{Bapiraju1994,
author = "Bapiraju, Vinnakota and Rao, V.V.Bapeswara",
doi = "10.1016/0020-0190(94)00083-2",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Binary tree enumeration,Combinatorial problems",
link = "http://www.sciencedirect.com/science/article/pii/0020019094000832 http://linkinghub.elsevier.com/retrieve/pii/0020019094000832",
month = "aug",
number = "3",
pages = "125--127",
title = "Enumeration of binary trees",
uri = "http://www.sciencedirect.com/science/article/pii/0020019094000832",
volume = "51",
year = "1994",
}
@article{Beyer1980,
author = "Beyer, Terry and Hedetniemi, Sandra Mitchell",
doi = "10.1137/0209055",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,3,algorithm,all binary,and all k-ary trees,and wilf,centered on rooted trees,in generating random trees,interest has arisen recently,introduction,lexicographic order,rooted tree generation,that is,the algorithm of nijenhuis,the present work has,those,trees,trees with a designated,vertex as the root",
link = "http://epubs.siam.org/doi/abs/10.1137/0209055",
month = "nov",
number = "4",
pages = "706--712",
title = "Constant Time Generation of Rooted Trees",
uri = "http://epubs.siam.org/doi/abs/10.1137/0209055",
volume = "9",
year = "1980",
}
@article{Er1985,
author = "Er, M. C.",
doi = "10.1093/comjnl/28.5.538",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oxfordjournals.org/content/28/5/538.abstract http://comjnl.oxfordjournals.org/content/28/5/538.short http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/28.5.538",
month = "may",
number = "5",
pages = "538--542",
title = "Enumerating Ordered Trees Lexicographically",
uri = "http://comjnl.oxfordjournals.org/content/28/5/538.abstract",
volume = "28",
year = "1985",
}
@article{Er1987,
author = "Er, M. C.",
doi = "10.1093/comjnl/30.6.569",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oxfordjournals.org/cgi/doi/10.1093/comjnl/30.6.569",
month = "dec",
number = "6",
pages = "569--572",
title = "Lexicographic Listing and Ranking of T-Ary Trees",
uri = "http://comjnl.oxfordjournals.org/cgi/doi/10.1093/comjnl/30.6.569",
volume = "30",
year = "1987",
}
@article{Er1992,
author = "Er, M. C.",
doi = "10.1093/comjnl/35.3.306",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oxfordjournals.org/cgi/doi/10.1093/comjnl/35.3.306",
month = "jun",
number = "3",
pages = "306--308",
title = "Efficient Generation of K-Ary Trees in Natural Order",
uri = "http://comjnl.oxfordjournals.org/cgi/doi/10.1093/comjnl/35.3.306",
volume = "35",
year = "1992",
}
@inproceedings{Ishida2008,
address = "Gold Coast, Queensland, Australia",
author = "Ishida, Yusuke and Zhao, Liang and Nagamochi, Hiroshi and Akutsu, Tatsuya",
booktitle = "the 19th International Conference on Genome Informatics 2008",
doi = "10.1142/9781848163324_0005",
editor = "Arthur, Jonathan and Ng, See-Kiong",
isbn = "9781848163317",
keyword = "chemical graph enumeration,chemical tree enumeration,detachment,feature vector,path frequency",
link = "http://www.worldscientific.com/doi/abs/10.1142/9781848163324_0005",
month = "dec",
pages = "53--64",
publisher = "Imperial College Press",
series = "Genome Informatics Series",
title = "Improved Algorithms for Enumerating Tree-like Chemical Graphs with Given Path Frequency",
uri = "http://www.worldscientific.com/doi/abs/10.1142/9781848163324_0005",
volume = "21",
year = "2008",
}
@article{Knop1981,
author = "Knop, J. V. and Mueller, W. R. and Jericevic, Z. and Trinajstic, N.",
doi = "10.1021/ci00030a009",
issn = "1549-9596",
journal = "Journal of Chemical Information and Modeling",
link = "http://pubs.acs.org/cgi-bin/doilookup/?10.1021/ci00030a009",
month = "may",
number = "2",
pages = "91--99",
title = "Computer enumeration and generation of trees and rooted trees",
uri = "http://pubs.acs.org/cgi-bin/doilookup/?10.1021/ci00030a009",
volume = "21",
year = "1981",
}
@article{Korsh1994,
author = "Korsh, James F.",
doi = "10.1016/0020-0190(94)00149-9",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Binary trees,Combinatorial algorithms,Combinatorial problems,Data structures,Loopless generation,Trees",
link = "http://www.sciencedirect.com/science/article/pii/0020019094001499 http://linkinghub.elsevier.com/retrieve/pii/0020019094001499",
month = "dec",
number = "5",
pages = "243--247",
title = "Loopless generation of k-ary tree sequences",
uri = "http://www.sciencedirect.com/science/article/pii/0020019094001499",
volume = "52",
year = "1994",
}
@article{Korsh1998,
author = "Korsh, James F. and Lipschutz, Seymour",
doi = "10.1016/S0020-0190(97)00215-9",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Binary trees,Combinatorial algorithms,Combinatorial problems,Data structures,Loopless generation,k-ary trees",
link = "http://www.sciencedirect.com/science/article/pii/S0020019097002159 http://linkinghub.elsevier.com/retrieve/pii/S0020019097002159",
month = "mar",
number = "5",
pages = "235--240",
title = "Shifts and loopless generation of k-ary trees",
uri = "http://www.sciencedirect.com/science/article/pii/S0020019097002159",
volume = "65",
year = "1998",
}
@article{Lucas1987,
author = "Lucas, Joan M.",
doi = "10.1016/0196-6774(87)90048-4",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677487900484 http://linkinghub.elsevier.com/retrieve/pii/0196677487900484",
month = "dec",
number = "4",
pages = "503--535",
title = "The Rotation Graph of Binary Trees Is Hamiltonian",
uri = "http://www.sciencedirect.com/science/article/pii/0196677487900484",
volume = "8",
year = "1987",
}
@article{Lucas1993,
author = "Lucas, Joan M. and Vanbaronaigien, D.R. and Ruskey, Frank",
doi = "10.1006/jagm.1993.1045",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S019667748371045X http://linkinghub.elsevier.com/retrieve/pii/S019667748371045X",
month = "nov",
number = "3",
pages = "343--366",
title = "On Rotations and the Generation of Binary Trees",
uri = "http://www.sciencedirect.com/science/article/pii/S019667748371045X",
volume = "15",
year = "1993",
}
@article{Nakano2002,
author = "Nakano, Shin-ichi",
doi = "10.1016/S0020-0190(02)00240-5",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "algorithms,enumeration,graphs,listing,plane graphs,plane trees",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0020019002002405",
month = "nov",
number = "3",
pages = "167--172",
title = "Efficient generation of plane trees",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0020019002002405",
volume = "84",
year = "2002",
}
@techreport{Nakano2003,
address = "Japan",
author = "Nakano, Shin-ichi and Uno, Takeaki",
institution = "National Institute for Infomatics",
link = "http://www.nii.ac.jp/TechReports/03-005E.pdf",
number = "Tech. Rep. NII-2003-005E",
title = "Efficient generation of rooted trees",
uri = "http://www.nii.ac.jp/TechReports/03-005E.pdf",
year = "2003",
zzzdoi = "MY/Nakano_Uno_2003_NIItech",
}
@inproceedings{Nakano2004,
address = "Honnef, Germany",
author = "Nakano, Shin-ichi and Uno, Takeaki",
booktitle = "WG 2004: the 30th International Workshop on Graph-Theoretic Concepts in Computer Science",
doi = "10.1007/978-3-540-30559-0_3",
editor = "Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard",
link = "http://link.springer.com/chapter/10.1007/978-3-540-30559-0_3",
month = "jun",
pages = "33--45",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Constant TIme Generation of Trees with Specified Diameter",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-30559-0_3",
volume = "3353",
year = "2004",
}
@inproceedings{Nakano2005a,
address = "Metz, France",
author = "Nakano, Shin-ichi and Uno, Takeaki",
booktitle = "WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science",
doi = "10.1007/11604686_22",
editor = "Kratsch, Dieter",
isbn = "3540310002",
issn = "03029743",
link = "http://link.springer.com/chapter/10.1007/11604686_22",
month = "jun",
pages = "249--260",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating colored trees",
uri = "http://link.springer.com/chapter/10.1007/11604686_22",
volume = "3787",
year = "2005",
}
@article{Nakano2009,
author = "Nakano, Shin-ichi",
issn = "18802818",
journal = "数理解析研究所講究録",
link = "http://ci.nii.ac.jp/naid/110007089589/",
number = "-",
pages = "55--62",
publisher = "京都大学",
title = "Listing All Trees with Specified Degree Sequence (Acceleration and Visualization of Computation for Enumeration Problems)",
uri = "http://ci.nii.ac.jp/naid/110007089589/",
volume = "1644",
year = "2009",
zzzdoi = "MY/NAKANO_2009_Kyoto_Cor",
}
@article{Pallo1986,
author = "Pallo, J. M.",
doi = "10.1093/comjnl/29.2.171",
issn = "0010-4620",
journal = "The Computer Journal",
month = "feb",
number = "2",
pages = "171--175",
title = "Enumerating, Ranking and Unranking Binary Trees",
volume = "29",
year = "1986",
}
@article{Pallo1987,
author = "Pallo, J.",
doi = "10.1080/00207168708803562",
issn = "0020-7160",
journal = "International Journal of Computer Mathematics",
link = "http://dx.doi.org/10.1080/00207168708803562",
month = "jan",
number = "2",
pages = "133--144",
publisher = "Taylor \& Francis",
title = "Generating Trees With N Nodes and M Leaves",
uri = "http://dx.doi.org/10.1080/00207168708803562",
volume = "21",
year = "1987",
}
@article{Proskurowski1980,
author = "Proskurowski, Andrzej",
doi = "10.1145/322169.322170",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=322169.322170 http://portal.acm.org/citation.cfm?doid=322169.322170",
month = "jan",
number = "1",
pages = "1--2",
publisher = "ACM",
title = "On the Generation of Binary Trees",
uri = "http://dl.acm.org/citation.cfm?id=322169.322170",
volume = "27",
year = "1980",
}
@article{Proskurowski1985,
author = "Proskurowski, Andrzej and Ruskey, Frank",
doi = "10.1016/0196-6774(85)90040-9",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677485900409 http://linkinghub.elsevier.com/retrieve/pii/0196677485900409",
month = "jun",
number = "2",
pages = "225--238",
title = "Binary Tree Gray Codes",
uri = "http://www.sciencedirect.com/science/article/pii/0196677485900409",
volume = "6",
year = "1985",
}
@article{Rotem1978a,
author = "Rotem, Doron and Varol, Y. L.",
doi = "10.1145/322077.322082",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=322077.322082",
month = "jul",
number = "3",
pages = "396--404",
publisher = "ACM",
title = "Generation of Binary Trees from Ballot Sequences",
uri = "http://dl.acm.org/citation.cfm?id=322077.322082",
volume = "25",
year = "1978",
}
@article{Ruskey1977,
author = "Ruskey, F. and Hu, T. C.",
doi = "10.1137/0206055",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "binary tree,feasible sequence,ranking algorithm",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0206055",
month = "dec",
number = "4",
pages = "745--758",
publisher = "Society for Industrial and Applied Mathematics",
title = "Generating Binary Trees Lexicographically",
uri = "http://epubs.siam.org/doi/abs/10.1137/0206055",
volume = "6",
year = "1977",
}
@article{Ruskey1978a,
author = "Ruskey, Frank",
doi = "10.1137/0207034",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "lattice walks,lexicographic order,ranking algorithms,t-ary trees",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0207034",
month = "nov",
number = "4",
pages = "424--439",
publisher = "Society for Industrial and Applied Mathematics",
title = "Generating T -Ary Trees Lexicographically",
uri = "http://epubs.siam.org/doi/abs/10.1137/0207034",
volume = "7",
year = "1978",
}
@article{Ruskey1990,
author = "Ruskey, Frank and Proskurowski, Andrzej",
doi = "10.1016/0196-6774(90)90030-I",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/019667749090030I http://linkinghub.elsevier.com/retrieve/pii/019667749090030I",
month = "mar",
number = "1",
pages = "68--84",
title = "Generating Binary Trees by Transpositions",
uri = "http://www.sciencedirect.com/science/article/pii/019667749090030I",
volume = "11",
year = "1990",
}
@article{Sawada2006,
author = "Sawada, Joe",
doi = "10.1145/1125994.1125995",
issn = "15496325",
journal = "ACM Transactions on Algorithms",
keyword = "CAT algorithm,chord diagram,free plane tree,necklace,planar tree,rooted plane tree",
link = "http://dl.acm.org/citation.cfm?id=1125994.1125995",
month = "jan",
number = "1",
pages = "1--13",
publisher = "ACM",
title = "Generating rooted and free plane trees",
uri = "http://dl.acm.org/citation.cfm?id=1125994.1125995",
volume = "2",
year = "2006",
}
@article{Schultz1982,
author = "Schultz, Phillip",
doi = "10.1016/0012-365X(82)90207-2",
issn = "0012365X",
journal = "Discrete Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0012365X82902072 http://linkinghub.elsevier.com/retrieve/pii/0012365X82902072",
month = "jan",
number = "2",
pages = "199--214",
title = "Enumerations of rooted trees with an application to group presentations",
uri = "http://www.sciencedirect.com/science/article/pii/0012365X82902072",
volume = "41",
year = "1982",
}
@article{Trojanowski1978,
author = "Trojanowski, Anthony E.",
doi = "10.1137/0207039",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "algorithm,binary trees,binomial coefficient,k-ary tree,linear order,permutation,ranking",
link = "http://epubs.siam.org/doi/abs/10.1137/0207039",
month = "nov",
number = "4",
pages = "492--509",
title = "Ranking and Listing Algorithms for k -Ary Trees",
uri = "http://epubs.siam.org/doi/abs/10.1137/0207039",
volume = "7",
year = "1978",
}
@article{VanBaronaigien1988,
author = "van Baronaigien, D.Roelants and Ruskey, Frank",
doi = "10.1016/0020-0190(88)90027-0",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "A-order,bijection,combinatorial generation,ranking,t-ary tree",
link = "http://www.sciencedirect.com/science/article/pii/0020019088900270",
month = "apr",
number = "4",
pages = "205--213",
title = "Generating t-ary trees in A-order",
uri = "http://www.sciencedirect.com/science/article/pii/0020019088900270",
volume = "27",
year = "1988",
}
@article{VanBaronaigien1991,
author = "van Baronaigien, D.Roelants",
doi = "10.1016/0020-0190(91)90178-K",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Combinatorial problems,binary tree,binary tree sequence,designs of algorithms,loopless algorithm",
link = "http://www.sciencedirect.com/science/article/pii/002001909190178K http://linkinghub.elsevier.com/retrieve/pii/002001909190178K",
month = "aug",
number = "4",
pages = "189--194",
title = "A loopless algorithm for generating binary tree sequences",
uri = "http://www.sciencedirect.com/science/article/pii/002001909190178K",
volume = "39",
year = "1991",
}
@article{Wright1986,
author = "Wright, Robert Alan and Richmond, Bruce and Odlyzko, Andrew and McKay, Brendan D.",
doi = "10.1137/0215039",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,a given size,all rooted trees of,an,an algorithm for generating,ation,beyer and hedetniemi exhibit,constant time generation,constructive enumer-,free tree,in 1,introduction,lexicographic order,loop-free algorithm,nonisomorphic trees,successor function to traverse,the method uses a,unrooted tree",
link = "http://epubs.siam.org/doi/abs/10.1137/0215039",
month = "may",
number = "2",
pages = "540--548",
title = "Constant Time Generation of Free Trees",
uri = "http://epubs.siam.org/doi/abs/10.1137/0215039",
volume = "15",
year = "1986",
}
@article{Xiang1997,
author = "Xiang, L.",
doi = "10.1093/comjnl/40.5.278",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/40.5.278",
month = "may",
number = "5",
pages = "278--291",
title = "Grammar-Oriented Enumeration of Binary Trees",
uri = "http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/40.5.278",
volume = "40",
year = "1997",
}
@inproceedings{Yamanaka2009a,
address = "Kolkata, India",
author = "Yamanaka, Katsuhisa and Otachi, Yota and Nakano, Shin-ichi",
booktitle = "WALCOM 2009: the 3rd International Workshop on Algorithms and Computation",
doi = "10.1007/978-3-642-00202-1_13",
editor = "Das, Sandip and Uehara, Ryuhei",
keyword = "algorithm,enumeration,family tree,graph,ordered tree",
link = "http://link.springer.com/chapter/10.1007/978-3-642-00202-1_13",
month = "feb",
pages = "141--150",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient Enumeration of Ordered Trees with k Leaves",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-00202-1_13",
volume = "5431",
year = "2009",
}
@article{Zaks1979,
author = "Zaks, Shumel and Richards, D.",
doi = "10.1137/0208006",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,1 leaves,2,all k-ary trees with,and,hence no,introduction,lattice path,lexicographic order,motivated by the problem,n nodes,no,of generating,ordered tree,problem for all trees,ranking,ranking and unranking,t,unranking,we solved the analogous,with ni",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0208006",
month = "feb",
number = "1",
pages = "73--81",
publisher = "Society for Industrial and Applied Mathematics",
title = "Generating Trees and Other Combinatorial Objects Lexicographically",
uri = "http://epubs.siam.org/doi/abs/10.1137/0208006",
volume = "8",
year = "1979",
}
@article{Zaks1980,
author = "Zaks, Shmuel",
doi = "10.1016/0304-3975(80)90073-0",
issn = "03043975",
journal = "Theoretical Computer Science",
link = "http://www.sciencedirect.com/science/article/pii/0304397580900730",
month = "jan",
number = "1",
pages = "63--82",
title = "Lexicographic generation of ordered trees",
uri = "http://www.sciencedirect.com/science/article/pii/0304397580900730",
volume = "10",
year = "1980",
}
@article{Zaks1982,
author = "Zaks, Shmuel",
doi = "10.1016/0020-0190(82)90140-5",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "binary trees,k-ary trees,lexicographic order",
link = "f http://linkinghub.elsevier.com/retrieve/pii/0020019082901405",
month = "mar",
number = "1",
pages = "44--48",
title = "Generation and ranking of K-ary trees",
uri = "f",
volume = "14",
year = "1982",
}
@article{Zerling1985,
author = "Zerling, David",
doi = "10.1145/3828.214141",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://portal.acm.org/citation.cfm?doid=3828.214141",
month = "jul",
number = "3",
pages = "694--701",
publisher = "ACM",
title = "Generating Binary Trees Using Rotations",
uri = "http://portal.acm.org/citation.cfm?doid=3828.214141",
volume = "32",
year = "1985",
}