The following pages link to Boolean-width of graphs (Q719257):
Displaying 34 items.
- Between treewidth and clique-width (Q300479) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- (Q4638063) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5009589) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
- On low rank-width colorings (Q5918207) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
