scientific article; zbMATH DE number 7666239
From MaRDI portal
Publication:5883508
Authors:
Publication date: 21 March 2023
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/85/ajc_v85_p164.pdf
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting linear extensions
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- A decomposition theorem for partially ordered sets
- The average number of linear extensions of a partial order
- Title not available (Why is that?)
- Linear extensions and order-preserving poset partitions
- 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
- On random generation of fuzzy measures
- A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- On randomized approximation for finding a level ideal of a poset and the generalized median stable matchings
- Counting linear extensions of posets with determinants of hook lengths
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)