Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (Q5173247): Difference between revisions

← Older edit

@@ Property / Recommended article @@
+Q5417642
@@ Property / Recommended article: Q5417642 / rank @@
+Normal rank
@@ Property / Recommended article: Q5417642 / qualifier @@
+Similarity Score: 0.97645986Amount 0.97645986
Unit 1
-Amount
+.97645986
 Unit
@@ Property / Recommended article: Q5417642 / qualifier @@
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+On hardness of approximating the parameterized clique problem
+Normal rank
+Similarity Score: 0.9144918Amount 0.9144918
Unit 1
-Amount
+.9144918
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Fast exact algorithms for some connectivity problems parameterized by clique-width
+Normal rank
+Similarity Score: 0.91407555Amount 0.91407555
Unit 1
-Amount
+.91407555
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
+Normal rank
+Similarity Score: 0.9139193Amount 0.9139193
Unit 1
-Amount
+.9139193
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q4232773
@@ Property / Recommended article: Q4232773 / rank @@
+Normal rank
@@ Property / Recommended article: Q4232773 / qualifier @@
+Similarity Score: 0.91313016Amount 0.91313016
Unit 1
-Amount
+.91313016
 Unit
@@ Property / Recommended article: Q4232773 / qualifier @@
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
+Normal rank
+Similarity Score: 0.9128208Amount 0.9128208
Unit 1
-Amount
+.9128208
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
+Similarity Score: 0.90720975Amount 0.90720975
Unit 1
-Amount
+.90720975
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+On the approximability of clique and related maximization problems
+Normal rank
+Similarity Score: 0.90628153Amount 0.90628153
Unit 1
-Amount
+.90628153
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Bounding clique-width via perfect graphs
@@ Property / Recommended article: Bounding clique-width via perfect graphs / rank @@
+Normal rank
+Similarity Score: 0.90607643Amount 0.90607643
Unit 1
-Amount
+.90607643
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Bounding Clique-Width via Perfect Graphs
@@ Property / Recommended article: Bounding Clique-Width via Perfect Graphs / rank @@
+Normal rank
+Similarity Score: 0.90607643Amount 0.90607643
Unit 1
-Amount
+.90607643
 Unit
+Recommender Run: Recommender Run 3