On the Boolean-Width of a Graph: Structure and Applications (Q3057622): Difference between revisions

@@ Property / cites work @@
+Treewidth computations. I: Upper bounds
@@ Property / cites work: Treewidth computations. I: Upper bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean-Width of Graphs
@@ Property / cites work: Boolean-Width of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Fast Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
+Normal rank
@@ Property / cites work @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-minor reductions can simulate edge contractions
+Normal rank
@@ Property / cites work @@
+Q3958592
@@ Property / cites work: Q3958592 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+Rank-width of random graphs
@@ Property / cites work: Rank-width of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Rank‐width is less than or equal to branch‐width
+Normal rank
@@ Property / cites work @@
+On the Boolean-Width of a Graph: Structure and Applications
+Normal rank
@@ Property / cites work @@
+Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank