Pages that link to "Item:Q2931399"
From MaRDI portal
The following pages link to Clique-width minimization is NP-hard (Q2931399):
Displaying 29 items.
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- The relative clique-width of a graph (Q2642017) (← links)
- A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
- Mike Fellows: Weaving the Web of Mathematics and Adventure (Q2908534) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
- Graphs of Linear Clique-Width at Most 3 (Q3502658) (← links)
- Clique-Width is NP-Complete (Q3563951) (← links)
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width (Q3569083) (← links)
- (Q4448752) (← links)
- Multi-clique-width (Q4638063) (← links)
- (Q5089227) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)
- Locating Eigenvalues of Symmetric Matrices - A Survey (Q6198240) (← links)
