Pages that link to "Item:Q2492189"

The following pages link to Level of repair analysis and minimum cost homomorphisms of graphs (Q2492189):

Displaying 20 items.

• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• New plain-exponential time classes for graph homomorphism (Q639844) (← links)
• Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
• Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
• Critical and maximum independent sets of a graph (Q1671323) (← links)
• An efficient model formulation for level of repair analysis (Q2267298) (← links)
• A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← 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)
• (Q5091252) (← links)
• (Q5136286) (← links)
• Bounded Tree-Width and CSP-Related Problems (Q5387797) (← 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)
• Critical properties of bipartite permutation graphs (Q6142657) (← links)