Pages that link to "Item:Q1974445"
From MaRDI portal
The following pages link to Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445):
Displaying 50 items.
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- Subgraph complementation (Q2182091) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Maximal double Roman domination in graphs (Q2247105) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- On the width of regular classes of finite structures (Q2305404) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- Clique-width of full bubble model graphs (Q2341723) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Clique-width and edge contraction (Q2350597) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices (Q2357129) (← links)
- Quadratic bottleneck knapsack problems (Q2359152) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Infinitely many minimal classes of graphs of unbounded clique-width (Q2413975) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- Digraphs of bounded elimination width (Q2442210) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
