Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202): Difference between revisions

@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779153
@@ Property / cites work: Q4779153 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+List homomorphisms to reflexive graphs
@@ Property / cites work: List homomorphisms to reflexive graphs / rank @@
+Normal rank
@@ Property / cites work @@
+List homomorphisms and circular arc graphs
@@ Property / cites work: List homomorphisms and circular arc graphs / 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 @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
+Normal rank
@@ Property / cites work @@
+\(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448769
@@ Property / cites work: Q4448769 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete Problems Involving Boolean Labelled Structures and Projection Transactions
+Normal rank