Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
From MaRDI portal
Publication:4943080
DOI10.1006/jagm.1999.1059zbMath0949.68170MaRDI QIDQ4943080
Paul S. jun. LaFollette, James F. Korsh
Publication date: 28 August 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1059
68W05: Nonnumerical algorithms
Related Items
Efficient enumeration of ordered trees with \(k\) leaves, Ordered trees and the inorder traversal, Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)