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