The following pages link to Counting linear extensions (Q1183942):
Displayed 19 items.
- 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)
- 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)
- Fast perfect sampling from linear extensions (Q2368931) (← links)
- Research problem: combinatorial and multilinear aspects of sign-balanced posets (Q2756163) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)