Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs
From MaRDI portal
Publication:3565872
Recommendations
- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
- Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
- Minimum cost homomorphisms to semicomplete multipartite digraphs
- Minimum cost and list homomorphisms to semicomplete digraphs
Cited in
(7)- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
- Colouring, constraint satisfaction, and complexity
- Minimum cost homomorphisms to semicomplete multipartite digraphs
- Minimum Cost Homomorphisms to Reflexive Digraphs
- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
- Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
- Minimum cost and list homomorphisms to semicomplete digraphs
This page was built for publication: Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565872)