Pages that link to "Item:Q2492190"
From MaRDI portal
The following pages link to Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190):
Displaying 11 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← 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)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
