Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
From MaRDI portal
Publication:2454050
DOI10.1007/s11083-013-9292-6zbMath1302.06004arXiv1208.2180MaRDI QIDQ2454050
Publication date: 12 June 2014
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.2180
distributive lattices; order ideals; Whitney numbers; subtrees; fixed cardinality; output-polynomial enumeration
06A07: Combinatorics of partially ordered sets
06D05: Structure and representation theory of distributive lattices
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incidence algebras that are uniquely determined by their zero-nonzero matrix pattern.
- On Whitney numbers of the order ideals of generalized fences and crowns
- The theory of convex geometries
- On estimating the number of order ideals in partial orders, with some applications
- Compactly generating all satisfying truth assignments of a Horn formula
- Listing and Counting Subtrees of a Tree
- Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
- Gray Codes for the Ideals of Interval Orders