Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2015.06.041
+Normal rank
@@ Property / OpenAlex ID @@
+W2179984694
@@ Property / OpenAlex ID: W2179984694 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633936
@@ Property / cites work: Q4633936 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of the induced matching problem
+Normal rank
@@ Property / cites work @@
+Approximating rank-width and clique-width quickly
@@ Property / cites work: Approximating rank-width and clique-width quickly / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Upper Bounds on Boolean-Width with Applications to Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5890909