Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
From MaRDI portal
Publication:2224808
Recommendations
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- scientific article; zbMATH DE number 2011835
- Generating a random linear extension of a partial order
- scientific article; zbMATH DE number 7058723
- Minimizing bumps in linear extensions of ordered sets
- A Generic Program for Minimal Subsets with Applications
- A loop-free algorithm for generating the linear extensions of a poset
- A comparison of algorithms for minimizing bumps in linear extensions of partial orders
- Linear extensions of a random partial order
Cites work
- Adjacency on the order polytope with applications to the theory of fuzzy measures
- Characterizing isometries on the order polytope with an application to the theory of fuzzy measures
- Combinatorial Markov chains on linear extensions
- Depth-First Search and Linear Graph Algorithms
- Fast perfect sampling from linear extensions
- Faster random generation of linear extensions
- scientific article; zbMATH DE number 5043346 (Why is no real title available?)
- Markov chains on graded posets. Compatibility of up-directed and down-directed transition probabilities
- Mixing times of lozenge tiling and card shuffling Markov chains
- Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties
- Monotonicity-based ranking on the basis of multiple partially specified reciprocal relations
- Non-additive measure and integral
- On random generation of fuzzy measures
- On the conductance of order Markov chains
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
- Optimal partial-order plan relaxation via MaxSAT
- Ordered sets. An introduction with connections from combinatorics to topology
- p-SYMMETRIC FUZZY MEASURES
- Probabilistic preference logic networks
- Scheduling with Precedence Constraints of Low Fractional Dimension
- Spectral gap for random-to-random shuffling on linear extensions
- The computational complexity of estimating MCMC convergence time
- Theory of capacities
- Topological sorting of large networks
- Two poset polytopes
Cited in
(19)- Knapsack problems with dependencies through non-additive measures and Choquet integral
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- Entropic uniform sampling of linear extensions in series-parallel posets
- A Generic Program for Minimal Subsets with Applications
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction
- Fundamentals of Computation Theory
- Random generation of k-interactive capacities
- Reduction of variables and constraints in fitting antibuoyant fuzzy measures to data using linear programming
- Random generation of capacities and its application in comprehensive decision aiding
- Aggregation with dependencies: capacities and fuzzy integrals
- Random generation of linearly constrained fuzzy measures and domain coverage performance evaluation
- An approximation algorithm for random generation of capacities
- Efficient random walks for generating random fuzzy measures in Möbius representation in large universe
- Efficient methods for verifying monotonicity of 2-additive fuzzy measures
- An improvement of random node generator for the uniform generation of capacities
- Uniform random fuzzy measures
- Capacities satisfying the buoyancy property on average
- A triangulation for pointed order polytopes
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
This page was built for publication: Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224808)
