Minimum Cost Homomorphisms with Constrained Costs (Q2817862): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Pavol Hell / rank
Normal rank
 
Property / author
 
Property / author: Pavol Hell / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963834637 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.07827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level of repair analysis and minimum cost homomorphisms of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Color Sum of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy for minimum cost graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of conservative valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing interval digraphs and interval bigraphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets of maximum weight in (\(p,q\))-colorable graphs. / rank
 
Normal rank

Latest revision as of 12:01, 12 July 2024

scientific article
Language Label Description Also known as
English
Minimum Cost Homomorphisms with Constrained Costs
scientific article

    Statements

    Minimum Cost Homomorphisms with Constrained Costs (English)
    0 references
    0 references
    2 September 2016
    0 references
    homomorphisms
    0 references
    NP-completeness
    0 references
    dichotomy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references