Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. D. Avis, Generating rooted triangulations without repetitions, Algorithmica, 16, (1996) 618–632.
2. T. Beyer and S. M. Hedetniemi, Constant time generation of rooted trees, SIAM J. Comput., 9, (1980) 706–712.
3. L. A. Goldberg, Efficient algorithms for listing combinatorial structures, Cambridge University Press, New York, (1993).
4. D. L. Kreher and D. R. Stinson, Combinatorial algorithms, CRC Press, Boca Raton, (1998).
5. Lect Notes Comput Sci;Z. Li,2001
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Family Trees for Enumeration;International Journal of Foundations of Computer Science;2023-06-16
2. Combinatorial Generation via Permutation Languages. III. Rectangulations;Discrete & Computational Geometry;2022-11-04
3. Escape from the Room;Lecture Notes in Computer Science;2022
4. Floorplans with Walls;Lecture Notes in Computer Science;2020
5. Enumerating Floorplans with Columns;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2018-09-01