scientific article; zbMATH DE number 7666239
From MaRDI portal
Publication:5883508
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3125399 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 5043346 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- A faster tree-decomposition based algorithm for counting linear extensions
- A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- Counting linear extensions
- Counting linear extensions of posets with determinants of hook lengths
- Linear extensions and order-preserving poset partitions
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- On random generation of fuzzy measures
- On randomized approximation for finding a level ideal of a poset and the generalized median stable matchings
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
- The average number of linear extensions of a partial order
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883508)