Author:
Yamanaka Katsuhisa,Otachi Yota,Nakano Shin-ichi
Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. Reverse search for enumeration;Avis;Discrete Appl. Math.,1996
2. Constant time generation of rooted trees;Beyer;SIAM J. Comput.,1980
3. A binary tree representation and related algorithms for generating integer partitions;Fenner;Comput. J.,1980
4. Efficient Algorithms for Listing Combinatorial Structures;Goldberg,1993
5. How to obtain the complete list of caterpillars;Kikuchi,2003
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Family Trees for Enumeration;International Journal of Foundations of Computer Science;2023-06-16
2. Generation of All Rooted Ordered Trees;Applied Computing for Software and Smart Systems;2023
3. Generation of All Rooted Ordered Trees;SSRN Electronic Journal;2022
4. Listing all spanning trees in Halin graphs — sequential and Parallel view;Discrete Mathematics, Algorithms and Applications;2018-02
5. Generation, Ranking and Unranking of Ordered Trees with Degree Bounds;Electronic Proceedings in Theoretical Computer Science;2016-03-02