Computing the number of mergings with constraints
From MaRDI portal
(Redirected from Publication:1108016)
Recommendations
Cites work
Cited in
(15)- Counting linear extensions
- Balanced pairs in partial orders
- Bounded capacity priority queues
- Reaching the bound in the \((2,n)\) merging problem
- Merging ordered sets.
- scientific article; zbMATH DE number 3990870 (Why is no real title available?)
- Proper mergings of stars and chains are counted by sums of antidiagonals in certain convolution arrays
- Merging-free partitions and run-sorted permutations
- Projection merging
- The worst balanced partially ordered sets-ladders with broken rungs
- Poset entropy versus number of linear extensions: the width-2 case.
- A combinatorial model for lane merging
- Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders
- The Ford-Johnson algorithm still unbeaten for less than 47 elements
- Disjunctive merging: quota and Gmin merging operators
This page was built for publication: Computing the number of mergings with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108016)