Listing and Counting Subtrees of a Tree

DOI10.1137/0210011zbMath0454.68081OpenAlexW1978630464MaRDI QIDQ3902521

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

ordered treelexicographic enumeration ranking algorithm

Mathematics Subject Classification ID

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

Related Items (9)

Enumeration problems for classes of self-similar graphs ⋮ Alternating Whitney sums and matchings in trees. 1 ⋮ Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. ⋮ Efficient algorithms on distributive lattices ⋮ On the Position Value for Special Classes of Networks ⋮ Hilbert series in the category of trees with contractions ⋮ On the average number of nodes in a subtree of a tree ⋮ Listing and counting subtrees of equal size of a binary tree ⋮ Gray codes from antimatroids

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