Computing Graph Polynomials on Graphs of Bounded Clique-Width (Q3522957): Difference between revisions

← Older edit

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/11917496_18
+Normal rank
@@ Property / OpenAlex ID @@
+W1524888420
@@ Property / OpenAlex ID: W1524888420 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
+Normal rank
+Similarity Score: 0.9568127Amount 0.9568127
Unit 1
-Amount
+.9568127
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Graph-Theoretic Concepts in Computer Science
+Normal rank
+Similarity Score: 0.9568127Amount 0.9568127
Unit 1
-Amount
+.9568127
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A multivariate interlace polynomial and its computation for graphs of bounded clique-width
+Normal rank
+Similarity Score: 0.9189324Amount 0.9189324
Unit 1
-Amount
+.9189324
 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.9165822Amount 0.9165822
Unit 1
-Amount
+.9165822
 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.9165822Amount 0.9165822
Unit 1
-Amount
+.9165822
 Unit
@@ Property / Recommended article: Q4608071 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Better Polynomial Algorithms on Graphs of Bounded Rank-Width
+Normal rank
+Similarity Score: 0.91609335Amount 0.91609335
Unit 1
-Amount
+.91609335
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4448752
@@ Property / Recommended article: Q4448752 / rank @@
+Normal rank
@@ Property / Recommended article: Q4448752 / qualifier @@
+Similarity Score: 0.9155409Amount 0.9155409
Unit 1
-Amount
+.9155409
 Unit
@@ Property / Recommended article: Q4448752 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q2768335
@@ Property / Recommended article: Q2768335 / rank @@
+Normal rank
@@ Property / Recommended article: Q2768335 / qualifier @@
+Similarity Score: 0.90800494Amount 0.90800494
Unit 1
-Amount
+.90800494
 Unit
@@ Property / Recommended article: Q2768335 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Graphs of bounded cliquewidth are polynomially $χ$-bounded
+Normal rank
+Similarity Score: 0.9072906Amount 0.9072906
Unit 1
-Amount
+.9072906
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3447288
@@ Property / Recommended article: Q3447288 / rank @@
+Normal rank
@@ Property / Recommended article: Q3447288 / qualifier @@
+Similarity Score: 0.9067018Amount 0.9067018
Unit 1
-Amount
+.9067018
 Unit
@@ Property / Recommended article: Q3447288 / qualifier @@
+Recommender Run: Recommender Run 2