Enumerating k-way trees

DOI10.1016/0020-0190(93)90180-HMaRDI QIDQ1313764zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 24 February 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90180-h

zbMATH Keywords

treesdata structures

Mathematics Subject Classification ID

Trees (05C05) Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Data structures (68P05)

Recommendations

• On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
• Uniform generation of forests of restricted height
• A coding algorithm for Rényi trees
• Publication:4502530
• Efficient enumeration of ordered trees with \(k\) leaves

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 42967 (Why is no real title available?)
• scientific article; zbMATH DE number 194510 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Counting and randomly generating binary trees
• Functional Composition Patterns and Power Series Reversion
• Proofs as programs

Cited in

(8)

• Random generation of trees and other combinatorial objects
• Cayley theorem on trees enumeration
• scientific article; zbMATH DE number 6928770 (Why is no real title available?)
• Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees
• Parking functions, valet functions and priority queues
• A new way of counting \(n^ m\)
• scientific article; zbMATH DE number 7075879 (Why is no real title available?)
• Uniform generation of forests of restricted height

This page was built for publication: Enumerating \(k\)-way trees

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