Q5875555 (Q5875555): Difference between revisions

← Older edit

@@ Property / Recommended article @@
+Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time
+Normal rank
+Similarity Score: 0.8837892Amount 0.8837892
Unit 1
-Amount
+.8837892
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Parameterized inapproximability of independent set in \(H\)-free graphs
+Normal rank
+Similarity Score: 0.87684834Amount 0.87684834
Unit 1
-Amount
+.87684834
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Parameterized inapproximability of independent set in \(H\)-free graphs
+Normal rank
+Similarity Score: 0.87684834Amount 0.87684834
Unit 1
-Amount
+.87684834
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Parameterized Complexity of Independent Set in H-Free Graphs.
+Normal rank
+Similarity Score: 0.87608933Amount 0.87608933
Unit 1
-Amount
+.87608933
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Parameterized complexity of independent set in H-free graphs
+Normal rank
+Similarity Score: 0.8750481Amount 0.8750481
Unit 1
-Amount
+.8750481
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs
+Normal rank
+Similarity Score: 0.8720511Amount 0.8720511
Unit 1
-Amount
+.8720511
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Structural Information and Communication Complexity
+Normal rank
+Similarity Score: 0.87031376Amount 0.87031376
Unit 1
-Amount
+.87031376
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+On the complexity of the independent set problem in triangle graphs
+Normal rank
+Similarity Score: 0.86912763Amount 0.86912763
Unit 1
-Amount
+.86912763
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
+Normal rank
+Similarity Score: 0.86810815Amount 0.86810815
Unit 1
-Amount
+.86810815
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q3115672
@@ Property / Recommended article: Q3115672 / rank @@
+Normal rank
@@ Property / Recommended article: Q3115672 / qualifier @@
+Similarity Score: 0.86750174Amount 0.86750174
Unit 1
-Amount
+.86750174
 Unit
@@ Property / Recommended article: Q3115672 / qualifier @@
+Recommender Run: Recommender Run 3