The following pages link to (Q4060733):
Displayed 9 items.
- Boolean techniques for matroidal decomposition of independence systems and applications to graphs (Q1063611) (← links)
- An O(m n) algorithm for regular set-covering problems (Q1095668) (← links)
- The greedy algorithm for partially ordered sets (Q1140103) (← links)
- Rank-axiomatic characterizations of independence systems (Q1144585) (← links)
- A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
- Boolean minors (Q1894774) (← links)
- Faces for a linear inequality in 0–1 variables (Q4074671) (← links)
- Facet of regular 0–1 polytopes (Q4074672) (← links)
- Regular (2, 2)-systems (Q4740583) (← links)