Enumerating \(k\)-way trees

DOI10.1016/0020-0190(93)90180-HzbMath0793.68045OpenAlexW2070793304MaRDI QIDQ1313764

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

data structurestrees

Mathematics Subject Classification ID

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

Related Items (3)

A new way of counting \(n^ m\) ⋮ Random generation of trees and other combinatorial objects ⋮ Parking functions, valet functions and priority queues

Cites Work

• Counting and randomly generating binary trees
• Proofs as programs
• Functional Composition Patterns and Power Series Reversion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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