Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs (Q5505675): Difference between revisions

@@ Property / cites work @@
+Digraphs with the path‐merging property
@@ Property / cites work: Digraphs with the path‐merging property / rank @@
+Normal rank
@@ Property / cites work @@
+In-tournament digraphs
@@ Property / cites work: In-tournament digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242937
@@ Property / cites work: Q4242937 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Cost Homomorphisms to Reflexive Digraphs
@@ Property / cites work: Minimum Cost Homomorphisms to Reflexive Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3565872
@@ Property / cites work: Q3565872 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Minimum Cost Homomorphism Dichotomy for Oriented Cycles
+Normal rank
@@ Property / cites work @@
+The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
+Normal rank
@@ Property / cites work @@
+Q3615793
@@ Property / cites work: Q3615793 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost and list homomorphisms to semicomplete digraphs
+Normal rank
@@ Property / cites work @@
+Minimum cost homomorphisms to semicomplete multipartite digraphs
+Normal rank
@@ Property / cites work @@
+Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
+Normal rank
@@ Property / cites work @@
+Level of repair analysis and minimum cost homomorphisms of graphs
+Normal rank
@@ Property / cites work @@
+A dichotomy for minimum cost graph homomorphisms
@@ Property / cites work: A dichotomy for minimum cost graph homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank