The following pages link to Counting linear extensions (Q1183942):
Displaying 50 items.
- Webs and posets (Q270321) (← links)
- Universal and overlap cycles for posets, words, and juggling patterns (Q293633) (← links)
- A comment on ``Computational complexity of stochastic programming problems'' (Q312699) (← links)
- Computational complexity of a solution for directed graph cooperative games (Q384201) (← links)
- Random threshold digraphs (Q405260) (← links)
- On a learning precedence graph concept for the automotive industry (Q439367) (← links)
- The combinatorics of tandem duplication (Q494419) (← links)
- Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge (Q551956) (← links)
- Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice (Q722587) (← links)
- A new characterization of \(\mathcal{V} \)-posets (Q781541) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Similarity of personal preferences: Theoretical foundations and empirical analysis (Q814460) (← links)
- A note on observables for counting trails and paths in graphs (Q846173) (← links)
- On \(P\)-partitions related to ordinal sums of posets (Q1024335) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- Counting linear extensions (Q1183942) (← links)
- The Shapley value for cooperative games under precedence constraints (Q1202565) (← links)
- Balanced pairs in partial orders (Q1301727) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- Order series of labelled posets (Q1318362) (← links)
- Finding parity difference by involutions (Q1356534) (← links)
- Approximating the number of linear extensions (Q1392204) (← links)
- Mixing times of lozenge tiling and card shuffling Markov chains (Q1431558) (← links)
- What is the dimension of citation space? (Q1619234) (← links)
- The computational complexity of calculating partition functions of optimal medians with Hamming distance (Q1631451) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences (Q1706249) (← links)
- Asymptotics of the number of standard Young tableaux of skew shape (Q1746566) (← links)
- Connected order ideals and \(P\)-partitions (Q1753036) (← links)
- Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons (Q1753037) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- Using TPA to count linear extensions (Q1757459) (← links)
- Rank tests from partially ordered data using importance and MCMC sampling methods (Q1790345) (← links)
- Algorithms for computing the Shapley value of cooperative games on lattices (Q1800390) (← links)
- Counting consistent phylogenetic trees is \#P-complete (Q1883389) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- Ranking the vertices of a complete multipartite paired comparison digraph (Q1923602) (← links)
- Posets with seven linear extensions sortable by three comparisons (Q1944901) (← links)
- Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures (Q2036791) (← links)
- Entropy conservation for comparison-based algorithms (Q2077296) (← links)
- Evolution on distributive lattices (Q2201887) (← links)
- Signature cumulants, ordered partitions, and independence of stochastic processes (Q2203621) (← links)
- Hook inequalities (Q2204969) (← links)
- Counting linear extensions of restricted posets (Q2215472) (← links)
- Combinatorial Markov chains on linear extensions (Q2248568) (← links)
- On the restricted cores and the bounded core of games on distributive lattices (Q2256340) (← links)
- Bottom-up: a new algorithm to generate random linear extensions of a poset (Q2279676) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Fast perfect sampling from linear extensions (Q2368931) (← links)
