Counting linear extensions

68Q25: Analysis of algorithms and problem complexity

68R05: Combinatorics in computer science

06A07: Combinatorics of partially ordered sets

Related Items

Two Double Poset Polytopes, Reconstruction of Partial Orders and List Representation as Random Structures, Webs and posets, Universal and overlap cycles for posets, words, and juggling patterns, A comment on ``Computational complexity of stochastic programming problems, Computational complexity of a solution for directed graph cooperative games, Random threshold digraphs, On a learning precedence graph concept for the automotive industry, The combinatorics of tandem duplication, Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge, Similarity of personal preferences: Theoretical foundations and empirical analysis, A note on observables for counting trails and paths in graphs, On \(P\)-partitions related to ordinal sums of posets, Ehrhart polynomials of matroid polytopes and polymatroids, Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case, Counting linear extensions, The Shapley value for cooperative games under precedence constraints, Balanced pairs in partial orders, Faster random generation of linear extensions, Order series of labelled posets, Finding parity difference by involutions, Approximating the number of linear extensions, Mixing times of lozenge tiling and card shuffling Markov chains, Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences, Counting consistent phylogenetic trees is \#P-complete, A loop-free algorithm for generating the linear extensions of a poset, Ranking the vertices of a complete multipartite paired comparison digraph, Posets with seven linear extensions sortable by three comparisons, Combinatorial Markov chains on linear extensions, On the restricted cores and the bounded core of games on distributive lattices, Fast perfect sampling from linear extensions, Sorting under partial information (without the ellipsoid algorithm)., On random generation of fuzzy measures, Research problem: combinatorial and multilinear aspects of sign-balanced posets, On Generalized Comparison-Based Sorting Problems, Exploiting Symmetries in Polyhedral Computations, MINING POSETS FROM LINEAR ORDERS, Badness of Serial Fit Revisited, Sequence Covering Arrays and Linear Extensions, How to integrate a polynomial over a simplex, Unnamed Item, Analysis on Aggregation Function Spaces, Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings

Cites Work