Pages that link to "Item:Q2496203"
From MaRDI portal
The following pages link to Approximating clique-width and branch-width (Q2496203):
Displayed 50 items.
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Excluding a bipartite circle graph from line graphs (Q3608319) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- Transforming graph states using single-qubit operations (Q4561771) (← links)
- (Q4625695) (← links)
- (Q4638063) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
- (Q5002765) (← links)
- (Q5005129) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5009491) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- (Q5075752) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Bipartite entanglement in continuous variable cluster states (Q5135175) (← links)
- Obstructions for Bounded Branch-depth in Matroids (Q5162868) (← links)
- The Rank-Width of the Square Grid (Q5302058) (← links)
- Distance Hereditary Graphs and the Interlace Polynomial (Q5428369) (← links)
- (Q5856407) (← links)
- (Q5856415) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- Computing with Tangles (Q5890774) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- On low rank-width colorings (Q5918207) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- Towards compositional graph theory (Q5971395) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
- Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Monoidal Width (Q6076171) (← links)
- A class of graphs with large rankwidth (Q6080165) (← links)