Linear time solvable optimization problems on graphs of bounded clique-width
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Parameterized model checking of rendezvous systems
- Coloring vertices of claw-free graphs in three colors
- On strict (outer-)confluent graphs
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Parameterized (approximate) defective coloring
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Digraphs of bounded width
- Solving larger maximum clique problems using parallel quantum annealing
- FO model checking on geometric graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
- Total Roman \(\{2\}\)-dominating functions in graphs
- (In)approximability of maximum minimal FVS
- On the width of regular classes of finite structures
- Parameterized complexity of geodetic set
- The exact weighted independent set problem in perfect graphs and related classes
- Parameterized (approximate) defective coloring
- Reasoning about integrity constraints for tree-structured data
- The power of cut-based parameters for computing edge-disjoint paths
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Meta-kernelization using well-structured modulators
- In)approximability of Maximum Minimal FVS
- Bounding clique-width via perfect graphs
- FO model checking of geometric graphs
- The many facets of upper domination
- Parameterized orientable deletion
- U-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- 4-coloring \((P_6, \text{bull})\)-free graphs
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Colouring square-free graphs without long induced paths
- The complexity landscape of decompositional parameters for ILP
- Complexity classification of the edge coloring problem for a family of graph classes
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- Solving problems on graphs of high rank-width
- Parameterized Complexity of Geodetic Set
- The factorisation forest theorem
- Extension complexity, MSO logic, and treewidth
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- Well-quasi-ordering versus clique-width
- Maximum matching in almost linear time on graphs of bounded clique-width
- On \textsf{NC} algorithms for problems on bounded rank-width graphs
- On the structure of (pan, even hole)-free graphs
- On width measures and topological problems on semi-complete digraphs
- Finer tight bounds for coloring on clique-width
- Finer tight bounds for coloring on clique-width
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes
- Clique-width of full bubble model graphs
- Branch-depth: generalizing tree-depth of graphs
- Domination and convexity problems in the target set selection model
- Containment of monadic Datalog programs via bounded clique-width
- Grundy distinguishes treewidth from pathwidth
- Complexity and algorithms for recognizing polar and monopolar graphs
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- On strict (outer-)confluent graphs
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Rank-width: algorithmic and structural results
- Algorithms for unipolar and generalized split graphs
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- On the computational complexity of the bipartizing matching problem
- Triple Roman domination in graphs
- Computing the zig-zag number of directed graphs
- A slice theoretic approach for embedding problems on digraphs
- Mind the independence gap
- Grundy dominating sequences on \(X\)-join product
- Complexity of the Packing Coloring Problem for Trees
- Feedback vertex set on AT-free graphs
- Quantified conjunctive queries on partially ordered sets
- Quantified conjunctive queries on partially ordered sets
- Trees, grids, and MSO decidability: from graphs to matroids
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Parameterized leaf power recognition via embedding into graph products
- Partial complementation of graphs
- A parameterized complexity view on collapsing \(k\)-cores
- Classifying the clique-width of \(H\)-free bipartite graphs
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- On list \(k\)-coloring convex bipartite graphs
- Bounding the clique-width of \(H\)-free chordal graphs
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
- Graphs vertex-partitionable into strong cliques
- Boundary classes for graph problems involving non-local properties
- Colouring diamond-free graphs
- A local characterization of bounded clique-width for line graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Meta-kernelization with structural parameters
- Graph classes with and without powers of bounded clique-width
- The complexity of power indexes with graph restricted coalitions
- On exact solution approaches for the longest induced path problem
- Structure and algorithms for (cap, even hole)-free graphs
- Clique-width for graph classes closed under complementation
- Counting spanning trees using modular decomposition
- First-order interpretations of bounded expansion classes
- Upper domination: towards a dichotomy through boundary properties
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Digraphs of bounded elimination width
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Compact representation of graphs of small clique-width
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
This page was built for publication: Linear time solvable optimization problems on graphs of bounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974445)
