Q4448752 (Q4448752): Difference between revisions

← Older edit

@@ Property / Recommended article @@
+Computing Graph Polynomials on Graphs of Bounded Clique-Width
+Normal rank
+Similarity Score: 0.9155409Amount 0.9155409
Unit 1
-Amount
+.9155409
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4232773
@@ Property / Recommended article: Q4232773 / rank @@
+Normal rank
@@ Property / Recommended article: Q4232773 / qualifier @@
+Similarity Score: 0.91346204Amount 0.91346204
Unit 1
-Amount
+.91346204
 Unit
@@ Property / Recommended article: Q4232773 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
+Similarity Score: 0.91086507Amount 0.91086507
Unit 1
-Amount
+.91086507
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
+Normal rank
+Similarity Score: 0.90650135Amount 0.90650135
Unit 1
-Amount
+.90650135
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4608071
@@ Property / Recommended article: Q4608071 / rank @@
+Normal rank
@@ Property / Recommended article: Q4608071 / qualifier @@
+Similarity Score: 0.9065013Amount 0.9065013
Unit 1
-Amount
+.9065013
 Unit
@@ Property / Recommended article: Q4608071 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Clique-Width is NP-Complete
@@ Property / Recommended article: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / Recommended article: Clique-Width is NP-Complete / qualifier @@
+Similarity Score: 0.90618265Amount 0.90618265
Unit 1
-Amount
+.90618265
 Unit
@@ Property / Recommended article: Clique-Width is NP-Complete / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q5417642
@@ Property / Recommended article: Q5417642 / rank @@
+Normal rank
@@ Property / Recommended article: Q5417642 / qualifier @@
+Similarity Score: 0.90279824Amount 0.90279824
Unit 1
-Amount
+.90279824
 Unit
@@ Property / Recommended article: Q5417642 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
+Similarity Score: 0.9009571Amount 0.9009571
Unit 1
-Amount
+.9009571
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
+Normal rank
+Similarity Score: 0.8987464Amount 0.8987464
Unit 1
-Amount
+.8987464
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Clique-width minimization is NP-hard
@@ Property / Recommended article: Clique-width minimization is NP-hard / rank @@
+Normal rank
+Similarity Score: 0.8984119Amount 0.8984119
Unit 1
-Amount
+.8984119
 Unit
+Recommender Run: Recommender Run 2