Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-74839-7_1
+Normal rank
@@ Property / OpenAlex ID @@
+W1848715483
@@ Property / OpenAlex ID: W1848715483 / rank @@
+Normal rank
@@ Property / cites work @@
+Classifying the Complexity of Constraints Using Finite Algebras
+Normal rank
@@ Property / cites work @@
+Bi‐arc graphs and the complexity of list homomorphisms
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
+Normal rank
@@ Property / cites work @@
+A complete complexity classification of the role assignment problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4847026
@@ Property / cites work: Q4847026 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank