Enumerating k-way trees

DOI10.1016/0020-0190(93)90180-HzbMATH Open0793.68045OpenAlexW2070793304MaRDI QIDQ1313764FDOQ1313764

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

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

zbMATH Keywords

treesdata structures

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Functional Composition Patterns and Power Series Reversion
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proofs as programs
• Counting and randomly generating binary trees

Cited In (8)

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

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)