Pages that link to "Item:Q4435348"
From MaRDI portal
The following pages link to Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348):
Displaying 32 items.
- Regular independent sets (Q260019) (← links)
- Vertex cover meets scheduling (Q270025) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Directed NLC-width (Q906393) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Computing the clique-width of cactus graphs (Q1744436) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Treewidth versus clique number in graph classes with a forbidden structure (Q2110610) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- The relative clique-width of a graph (Q2642017) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree (Q4652630) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width (Q5405029) (← links)
