Listing and Counting Subtrees of a Tree
From MaRDI portal
Publication:3902521
DOI10.1137/0210011zbMath0454.68081MaRDI QIDQ3902521
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
68R10: Graph theory (including graph drawing) in computer science
68R99: Discrete mathematics in relation to computer science
Related Items
On the Position Value for Special Classes of Networks, Efficient algorithms on distributive lattices, 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.