Counting linear extension majority cycles in partially ordered sets on up to 13 elements
From MaRDI portal
Publication:980203
DOI10.1016/j.camwa.2009.12.021zbMath1189.06001OpenAlexW1972198883WikidataQ60257360 ScholiaQ60257360MaRDI QIDQ980203
K. De Loof, Bernard De Baets, H. E. De Meyer
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.12.021
Related Items (3)
On the cycle-transitivity of the mutual rank probability relation of a poset ⋮ Learning intransitive reciprocal relations with kernel methods ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the cycle-transitivity of the mutual rank probability relation of a poset
- Posets on up to 16 points
- Linear extension majority cycles on partial orders
- An improvement of the tree code construction
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
- Linear extension majority cycles in height-1 orders
- Linear extension majority cycles for small (n\(\leq 9)\) partial orders
- Proportional transitivity in linear extensions of ordered sets
- On linear extensions of ordered sets with a symmetry
- On linear extension majority graphs of partial orders
- On proportional transitivity of ordered sets
- Long-concave functions and poset probabilities
- Balanced pairs in partial orders
- The effectiveness of weighted scoring rules when pairwise majority rule cycles exist.
- Balancing pairs and the cross product conjecture
- On the family of linear extensions of a partial order
- An algorithm to generate all topological sorting arrangements
- Frequency estimates for linear extension majority cycles on partial orders
- A comparative analysis of methods for constructing weak orders from partial orders
- Efficient algorithms on distributive lattices
This page was built for publication: Counting linear extension majority cycles in partially ordered sets on up to 13 elements
