Pages that link to "Item:Q3503501"
From MaRDI portal
The following pages link to The Hardness of Approximating Poset Dimension (Q3503501):
Displayed 11 items.
- Succinct posets (Q329288) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- Dimension preserving contractions and a finite list of 3-irreducible posets (Q766141) (← links)
- Semi-transitive orientations and word-representable graphs (Q908303) (← links)
- MINING POSETS FROM LINEAR ORDERS (Q2874042) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- Alternation Graphs (Q3104776) (← links)
- A study of the order dimension of a poset using matrices (Q5236031) (← links)
- Topological Aspects of Matrix Abduction 2 (Q5350344) (← links)
- The small inductive dimension of finite lattices through matrices (Q6040757) (← links)