Pages that link to "Item:Q1086160"
From MaRDI portal
The following pages link to An algorithm to generate the ideals of a partial order (Q1086160):
Displaying 25 items.
- Efficient generation of the ideals of a poset in Gray code order. II (Q391390) (← links)
- On extensions, linear extensions, upsets and downsets of ordered sets (Q556831) (← links)
- Characterizing isometries on the order polytope with an application to the theory of fuzzy measures (Q845331) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- Efficient generation of the ideals of a poset in Gray code order (Q989454) (← links)
- On Whitney numbers of the order ideals of generalized fences and crowns (Q1011689) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- Extracting maximal information about sets of minimum cuts (Q1261290) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- Tree structure for distributive lattices and its applications (Q1366682) (← links)
- Maximal closure on a graph with resource constraints (Q1366709) (← links)
- Skyline groups are ideals. An efficient algorithm for enumerating skyline groups (Q2115858) (← links)
- Adjacency on the order polytope with applications to the theory of fuzzy measures (Q2270242) (← links)
- Learning Bayesian network parameters under order constraints (Q2499046) (← links)
- Algorithmic combinatorics based on slicing posets (Q2503297) (← links)
- Fast Detection of Stable and Count Predicates in Parallel Computations (Q3300821) (← links)
- (Q3336682) (← links)
- Calcul des idéaux d'un ordonné fini (Q3360658) (← links)
- ON THE IDEAL-GENERATING FUNCTIONS OF SECTIONALLY DECOMPOSED DIGRAPHS (Q4221161) (← links)
- (Q4733891) (← links)
- On-line computations of the ideal lattice of posets (Q4850326) (← links)
- Finding a Level Ideal of a Poset (Q5323080) (← links)
- Efficient algorithms on distributive lattices (Q5936459) (← links)
- Partial order bounding: A new approach to evaluation in game tree search (Q5941319) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
