scientific article; zbMATH DE number 7666239
From MaRDI portal
Publication:5883508
No author found.
Publication date: 21 March 2023
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/85/ajc_v85_p164.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A faster tree-decomposition based algorithm for counting linear extensions
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
- Counting linear extensions
- The average number of linear extensions of a partial order
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets
- Linear extensions and order-preserving poset partitions
- On random generation of fuzzy measures
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
- A decomposition theorem for partially ordered sets
- On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- Counting Linear Extensions of Posets with Determinants of Hook Lengths
This page was built for publication:
