The following pages link to (Q4125770):
Displayed 4 items.
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- On the succinct representation of graphs (Q800734) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Maximum weight edge-constrained matchings (Q2476253) (← links)