Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence

DOI10.1006/JAGM.1999.1059MaRDI QIDQ4943080zbMATH OpenOpenAlexFDO

Authors James F. Korsh, Paul S. jun. LaFollette

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Loopless Generation of Trees with Specified Degrees
• scientific article; zbMATH DE number 3961006
• scientific article; zbMATH DE number 3935065
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• Generating ordered trees

Cited in

(9)

• Solution of some multi-dimensional lattice path parity difference recurrence relations
• Ordered trees and the inorder traversal
• Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
• Generating trees on multisets
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• scientific article; zbMATH DE number 3935065 (Why is no real title available?)
• Efficient enumeration of ordered trees with \(k\) leaves
• Loopless Generation of Trees with Specified Degrees
• scientific article; zbMATH DE number 7051269 (Why is no real title available?)

This page was built for publication: Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943080)