Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Independent sets of maximum weight in (\(p,q\))-colorable graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms to powers of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of Homomorphisms to Oriented Cycles and of <i>k</i>-Partite Satisfiability / 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: Digraph matrix partitions and trigraph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost and list homomorphisms to semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost homomorphisms to semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs / 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: A dichotomy for minimum cost graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of tree homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Results for the Optimum Cost Chromatic Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three short proofs in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the Homomorphic Preimages of Certain Oriented Cycles / rank
 
Normal rank

Latest revision as of 21:22, 27 June 2024

scientific article; zbMATH DE number 5263906
Language Label Description Also known as
English
Minimum Cost Homomorphisms to Reflexive Digraphs
scientific article; zbMATH DE number 5263906

    Statements

    Minimum Cost Homomorphisms to Reflexive Digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    homomorphism
    0 references
    minimum cost homomorphism
    0 references
    reflexive digraph
    0 references
    polynomial time algorithm
    0 references
    NP-completeness
    0 references
    dichotomy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references