Pages that link to "Item:Q4962768"
From MaRDI portal
The following pages link to Approximating rank-width and clique-width quickly (Q4962768):
Displaying 40 items.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Computing rank-width exactly (Q989474) (← links)
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- On \textsf{NC} algorithms for problems on bounded rank-width graphs (Q1799577) (← links)
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (Q1933649) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width (Q3569083) (← links)
- How Bad is the Freedom to Flood-It? (Q4622773) (← links)
- Multi-clique-width (Q4638063) (← links)
- (Q5002812) (← links)
- (Q5009491) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- On structural parameterizations of firefighting (Q5920210) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
- Structural parameterizations of vertex integrity (Q6652467) (← links)
