The following pages link to A Poset Dimension Algorithm (Q4228291):
Displaying 18 items.
- On building the transitive reduction of a two-dimensional poset (Q287116) (← links)
- Computing a poset from its realizer (Q287260) (← links)
- On recognizing the dimension of a poset (Q1293056) (← links)
- Soft dimension theory. (Q1398925) (← links)
- Searching for the dimension of valued preference relations. (Q1401118) (← links)
- Fuzzy classification systems. (Q1429954) (← links)
- Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography (Q2136288) (← links)
- A study of the quasi covering dimension of finite lattices (Q2322752) (← links)
- Algorithmic combinatorics based on slicing posets (Q2503297) (← links)
- The Hardness of Approximating Poset Dimension (Q3503501) (← links)
- AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION (Q3596984) (← links)
- Crisp dimension theory and valued preference relations (Q4471213) (← links)
- (Q4898431) (← links)
- (Q4948642) (← links)
- Block circulant graphs and the graphs of critical pairs of crowns (Q5009946) (← links)
- A study of the order dimension of a poset using matrices (Q5236031) (← links)
- (Q5437973) (← links)
- Partial order bounding: A new approach to evaluation in game tree search (Q5941319) (← links)