Listing and Counting Subtrees of a Tree

DOI10.1137/0210011MaRDI QIDQ3902521zbMATH OpenOpenAlexFDO

Authors Frank Ruskey

Publication date 1981

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0210011

zbMATH Keywords

lexicographic enumeration ranking algorithmordered tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Cited in

(12)

• Listing and counting subtrees of equal size of a binary tree
• Alternating Whitney sums and matchings in trees. 1
• Gray codes from antimatroids
• On the average number of nodes in a subtree of a tree
• Hilbert series in the category of trees with contractions
• Enumeration problems for classes of self-similar graphs
• Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
• On the position value for special classes of networks
• Efficient algorithms on distributive lattices
• The number of spanning trees for Sierpiński graphs and data center networks
• Exact counting of subtrees with diameter no more than d in trees: a generating function approach
• The combinatorics of \(N_\infty\) operads for \(C_{qp^n}\) and \(D_{p^n}\)

This page was built for publication: Listing and Counting Subtrees of a Tree

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