On the random generation and counting of weak order extensions of a poset with given class cardinalities

DOI10.1016/j.ins.2006.04.003zbMath1111.06001OpenAlexW2002930081WikidataQ60258028 ScholiaQ60258028MaRDI QIDQ867611

Bernard De Baets, K. De Loof, H. E. De Meyer

Publication date: 16 February 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2006.04.003

zbMATH Keywords

posetidealrandom generationmonotone data setweak order extension

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Related Items (7)

Random generation of \(k\)-interactive capacities ⋮ Random generation of capacities and its application in comprehensive decision aiding ⋮ Unnamed Item ⋮ On random generation of fuzzy measures ⋮ Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets ⋮ On the random generation of monotone data sets ⋮ Counting linear extension majority cycles in partially ordered sets on up to 13 elements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster random generation of linear extensions
• Weak-order extensions of an order.
• A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting
• Mathematical classification and clustering
• MONOTONE APPROXIMATION OF AGGREGATION OPERATORS USING LEAST SQUARES SPLINES
• Efficient algorithms on distributive lattices

This page was built for publication: On the random generation and counting of weak order extensions of a poset with given class cardinalities