Boolean-Width of Graphs (Q3656851): 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 @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+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 @@
+Q4938660
@@ Property / cites work: Q4938660 / 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 @@
+Branch-width and well-quasi-ordering in matroids and graphs.
+Normal rank
@@ Property / cites work @@
+Finding Branch-Decompositions and Rank-Decompositions
+Normal rank
@@ Property / cites work @@
+Decomposition of perfect graphs
@@ Property / cites work: Decomposition of perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Rank-Width of the Square Grid
@@ Property / cites work: The Rank-Width of the Square Grid / rank @@
+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 @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Rank‐width is less than or equal to branch‐width
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
+Normal rank