Pages that link to "Item:Q968147"
From MaRDI portal
The following pages link to The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147):
Displaying 6 items.
- Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← links)
- Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
- (Q3615793) (← 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)