scientific article; zbMATH DE number 5043346
From MaRDI portal
Publication:5480660
zbMath1110.06001MaRDI QIDQ5480660
K. De Loof, Bernard De Baets, H. E. De Meyer
Publication date: 3 August 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Nonnumerical algorithms (68W05) Combinatorics of partially ordered sets (06A07) Total orders (06A05)
Related Items (16)
Complexity reduction and approximation of multidomain systems of partially ordered data ⋮ Succinct posets ⋮ A frequentist view on cycle-transitivity of reciprocal relations ⋮ On the random generation and counting of weak order extensions of a poset with given class cardinalities ⋮ Random generation of \(k\)-interactive capacities ⋮ On the cycle-transitivity of the mutual rank probability relation of a poset ⋮ Unnamed Item ⋮ On random generation of fuzzy measures ⋮ The Worst Balanced Partially Ordered Sets—Ladders with Broken Rungs ⋮ Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets ⋮ Counting linear extensions: parameterizations by treewidth ⋮ On the random generation of monotone data sets ⋮ Counting linear extension majority cycles in partially ordered sets on up to 13 elements ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem ⋮ Unnamed Item
This page was built for publication:
