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)- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Complexity of the Packing Coloring Problem for Trees
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Trees, grids, and MSO decidability: from graphs to matroids
- A parameterized complexity view on collapsing \(k\)-cores
- Directed NLC-width
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Graph classes with structured neighborhoods and algorithmic applications
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Parameterized complexity for iterated type partitions and modular-width
- MAD trees and distance-hereditary graphs
- Recurrence relations for graph polynomials on bi-iterative families of graphs
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
- Tree pivot-minors and linear rank-width
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Regular independent sets
- An algorithmic metatheorem for directed treewidth
- Clique-width of path powers
- Towards fixed-parameter tractable algorithms for abstract argumentation
- On the parameterized complexity of reconfiguration of connected dominating sets
- Recognizability, hypergraph operations, and logical types
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Computing the zig-zag number of directed graphs
- Feferman-vaught decompositions for prefix classes of first order logic
- Coloring vertices of claw-free graphs in three colors
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- On low rank-width colorings
- Are there any good digraph width measures?
- Graph partitions with prescribed patterns
- Grundy Distinguishes Treewidth from Pathwidth
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- A Logical Approach to Constraint Satisfaction
- Computing the largest bond and the maximum connected cut of a graph
- Colouring square-free graphs without long induced paths
- Solving larger maximum clique problems using parallel quantum annealing
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Finer tight bounds for coloring on clique-width
- Finer tight bounds for coloring on clique-width
- Graph operations, graph transformations and monadic second-order logic: a survey
- Packing disjoint cycles over vertex cuts
- Infinitely many minimal classes of graphs of unbounded clique-width
- Computing densest \(k\)-subgraph with structural parameters
- On efficient domination for some classes of \(H\)-free bipartite graphs
- On polynomial kernels for structural parameterizations of odd cycle transversal
- On the outer independent total double Roman domination in graphs
- Treewidth versus clique number. II: Tree-independence number
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes
- scientific article; zbMATH DE number 7651174 (Why is no real title available?)
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- How Bad is the Freedom to Flood-It?
- The complexity of some graph problems with bounded minors of their constraint matrices
- Algorithmic uses of the Feferman-Vaught theorem
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Quantified conjunctive queries on partially ordered sets
- Quantified conjunctive queries on partially ordered sets
- Minimal classes of graphs of unbounded clique-width
- First-Order Model-Checking in Random Graphs and Complex Networks
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes
- Courcelle's theorem -- a game-theoretic approach
- Low-congestion shortcut and graph parameters
- Graphs of separability at most 2
- Parameterized complexity of generalized domination problems
- Polynomial-time recognition of clique-width 3 graphs
- Critical elements in combinatorially closed families of graph classes
- Graphs of linear clique-width at most 3
- On strict (outer-)confluent graphs
- Vertex cover at distance on \(H\)-free graphs
- The maximum weight stable set problem in (\(P_6\), bull)-free graphs
- On strict (outer-)confluent graphs
- The factorisation forest theorem
- Complexity and approximability of parameterized MAX-CSPs
- Stability, vertex stability, and unfrozenness for special graph classes
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- scientific article; zbMATH DE number 7656024 (Why is no real title available?)
- Recovering sparse graphs
- Maximal double Roman domination in graphs
- scientific article; zbMATH DE number 7204407 (Why is no real title available?)
- Are there any good digraph width measures?
- A polynomial kernel for 3-leaf power deletion
- Vertex disjoint paths on clique-width bounded graphs
- Well-quasi-ordering versus clique-width
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- On a disparity between relative cliquewidth and relative NLC-width
- Recent developments on graphs of bounded clique-width
- Tree-width and the monadic quantifier hierarchy.
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Quadruple Roman domination in graphs
- Constrained-path labellings on graphs of bounded clique-width
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
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)
