Linear time solvable optimization problems on graphs of bounded clique-width
From MaRDI portal
Publication:1974445
DOI10.1007/S002249910009zbMATH Open1009.68102OpenAlexW2053991811WikidataQ56474999 ScholiaQ56474999MaRDI QIDQ1974445FDOQ1974445
Authors: Udi Rotics, Johann A. Makowsky, Bruno Courcelle 
Publication date: 18 March 2003
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.3501
Recommendations
Cited In (only showing first 100 items - show all)
- Coloring vertices of claw-free graphs in three colors
- Solving larger maximum clique problems using parallel quantum annealing
- Colouring square-free graphs without long induced paths
- Computing the largest bond and the maximum connected cut of a graph
- Finer tight bounds for coloring on clique-width
- Finer tight bounds for coloring on clique-width
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Parameterized and approximation complexity of \textsc{Partial VC Dimension}
- Quantified conjunctive queries on partially ordered sets
- Quantified conjunctive queries on partially ordered sets
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes
- On strict (outer-)confluent graphs
- On strict (outer-)confluent graphs
- The factorisation forest theorem
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Well-quasi-ordering versus clique-width
- FO model checking on geometric graphs
- Parameterized complexity of geodetic set
- 4-coloring \((P_6, \text{bull})\)-free graphs
- The complexity landscape of decompositional parameters for ILP
- Parameterized model checking of rendezvous systems
- FO model checking of geometric graphs
- Bounding clique-width via perfect graphs
- Parameterized orientable deletion
- On efficient domination for some classes of \(H\)-free chordal graphs
- Reasoning about integrity constraints for tree-structured data
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- On the width of regular classes of finite structures
- Containment of monadic Datalog programs via bounded clique-width
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Maximum matching in almost linear time on graphs of bounded clique-width
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Complexity classification of the edge coloring problem for a family of graph classes
- On \textsf{NC} algorithms for problems on bounded rank-width graphs
- The exact weighted independent set problem in perfect graphs and related classes
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- The many facets of upper domination
- Extension complexity, MSO logic, and treewidth
- On the structure of (pan, even hole)-free graphs
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- Complexity and algorithms for recognizing polar and monopolar graphs
- Parameterized Complexity of Geodetic Set
- Model checking existential logic on partially ordered sets
- Induced minor free graphs: isomorphism and clique-width
- Parameterized complexity of fair deletion problems
- Digraphs of bounded width
- Solving problems on graphs of high rank-width
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- A slice theoretic approach for embedding problems on digraphs
- Parameterized aspects of triangle enumeration
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width
- Domination and convexity problems in the target set selection model
- Graph classes with structured neighborhoods and algorithmic applications
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Regular independent sets
- An algorithmic metatheorem for directed treewidth
- Clique-width of path powers
- Graph partitions with prescribed patterns
- On polynomial kernels for structural parameterizations of odd cycle transversal
- Minimal classes of graphs of unbounded clique-width
- Courcelle's theorem -- a game-theoretic approach
- Graphs of linear clique-width at most 3
- Are there any good digraph width measures?
- Tree-width and the monadic quantifier hierarchy.
- \(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
- On the structure of (\(P_{5}\),\,gem)-free graphs
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Edge dominating set and colorings on graphs with fixed clique-width
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Clique cycle-transversals in distance-hereditary graphs
- Between treewidth and clique-width
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- On structural parameterizations of star coloring
- Efficient algorithms for Roman domination on some classes of graphs
- Algorithmic meta-theorems for restrictions of treewidth
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Tight complexity bounds for FPT subgraph problems parameterized by clique-width
- Graph classes with structured neighborhoods and algorithmic applications
- On the clique-width of some perfect graph classes
- Boolean-width of graphs
- On algorithms for (\(P_5\), gem)-free graphs
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Solving some NP-complete problems using split decomposition
- Complexity of the packing coloring problem for trees
- Line graphs of bounded clique-width
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Automata for the verification of monadic second-order graph properties
- Critical hereditary graph classes: a survey
- Independent domination in finitely defined classes of graphs: polynomial algorithms
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)
