Pages that link to "Item:Q5458527"
From MaRDI portal
The following pages link to Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527):
Displaying 9 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← 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)
- Adjusted interval digraphs (Q2839215) (← links)
- Minimum Cost Homomorphism Dichotomy for Oriented Cycles (Q3511431) (← links)
- (Q3615793) (← links)
- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs (Q5505675) (← links)
- Algorithmic Applications in Management (Q5710145) (← links)