A Poset Dimension Algorithm
From MaRDI portal
Recommendations
Cited in
(22)- On recognizing the dimension of a poset
- Soft dimension theory.
- Searching for the dimension of valued preference relations.
- Fuzzy classification systems.
- Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography
- A study of the quasi covering dimension of finite lattices
- Algorithmic combinatorics based on slicing posets
- On building the transitive reduction of a two-dimensional poset
- Computing a poset from its realizer
- The complexity of the partial order dimension problem: closing the gap
- The Hardness of Approximating Poset Dimension
- AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION
- Crisp dimension theory and valued preference relations
- scientific article; zbMATH DE number 1554930 (Why is no real title available?)
- scientific article; zbMATH DE number 6120549 (Why is no real title available?)
- scientific article; zbMATH DE number 1431711 (Why is no real title available?)
- Order dimension of layered generalized crowns.
- Block circulant graphs and the graphs of critical pairs of crowns
- A study of the order dimension of a poset using matrices
- scientific article; zbMATH DE number 5230562 (Why is no real title available?)
- Partial order bounding: A new approach to evaluation in game tree search
- Finite lattices and large inductive dimension
This page was built for publication: A Poset Dimension Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228291)
