Pages that link to "Item:Q2427539"

The following pages link to A dichotomy for minimum cost graph homomorphisms (Q2427539):

Displaying 23 items.

• Colouring, constraint satisfaction, and complexity (Q458466) (← links)
• New plain-exponential time classes for graph homomorphism (Q639844) (← links)
• Counting loopy graphs with given degrees (Q763074) (← links)
• Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← 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)
• An efficient model formulation for level of repair analysis (Q2267298) (← links)
• Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
• \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
• Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
• New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
• Minimum Cost Homomorphism Dichotomy for Oriented Cycles (Q3511431) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• (Q5091252) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
• Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
• Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
• Introduction to the Maximum Solution Problem (Q5504706) (← links)
• Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs (Q5505675) (← links)
• (Q5874504) (← links)
• Critical properties of bipartite permutation graphs (Q6142657) (← links)
• Vertex ordering with precedence constraints (Q6546603) (← links)