The following pages link to (Q3615793):
Displaying 6 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs (Q5505675) (← links)
- Algorithmic Applications in Management (Q5710145) (← links)