Linear time solvable optimization problems on graphs of bounded clique-width
From MaRDI portal
(Redirected from Publication:1974445)
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
- Clique-width with an inactive label
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- Confronting intractability via parameters
- Obstructions for linear rank-width at most 1
- A boundary property for upper domination
- Upper domination: complexity and approximation
- Well-quasi-ordering does not imply bounded clique-width
- Compact labelings for efficient first-order model-checking
- Clique-width of countable graphs: A compactness property.
- A Logical Approach to Constraint Satisfaction
- scientific article; zbMATH DE number 7278055 (Why is no real title available?)
- Colouring vertices of triangle-free graphs
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
- Graphs of separability at most two: structural characterizations and their consequences
- Constrained-path labellings on graphs of bounded clique-width
- Linear clique-width for hereditary classes of cographs
- Recurrence relations for graph polynomials on bi-iterative families of graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Farrell polynomials on graphs of bounded tree width
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- Graphs of separability at most 2
- Parameterized complexity of generalized domination problems
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Quadratic bottleneck knapsack problems
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- The maximum weight stable set problem in (\(P_6\), bull)-free graphs
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices
- scientific article; zbMATH DE number 7764115 (Why is no real title available?)
- Directed NLC-width
- Characterizations for restricted graphs of NLC-width 2
- Dominating induced matchings in graphs without a skew star
- Vertex disjoint paths on clique-width bounded graphs
- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
- On digraph width measures in parameterized algorithmics
- Graph decomposition of slim graphs
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- On some domination colorings of graphs
- Recognizability, hypergraph operations, and logical types
- On the structure of graphs without claw, \(4K_1\) and co-R
- Clique-width and edge contraction
- The rank-width of edge-coloured graphs
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- From tree-decompositions to clique-width terms
- Chordal bipartite graphs of bounded tree- and clique-width
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)
