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
- Trees, grids, and MSO decidability: from graphs to matroids
- A parameterized complexity view on collapsing \(k\)-cores
- Tree pivot-minors and linear rank-width
- Title not available (Why is that?)
- On low rank-width colorings
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
- Computing the zig-zag number of directed graphs
- Are there any good digraph width measures?
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Packing disjoint cycles over vertex cuts
- Low-congestion shortcut and graph parameters
- A polynomial kernel for 3-leaf power deletion
- Title not available (Why is that?)
- Structure and algorithms for (cap, even hole)-free graphs
- First-order interpretations of bounded expansion classes
- Notes on complexity of packing coloring
- On the computational complexity of the bipartizing matching problem
- Parameterized edge Hamiltonicity
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Upper domination: towards a dichotomy through boundary properties
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Compact representation of graphs of small clique-width
- On list \(k\)-coloring convex bipartite graphs
- Feedback vertex set on AT-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
- Comparing linear width parameters for directed graphs
- Colouring square-free graphs without long induced paths
- Boundary classes for graph problems involving non-local properties
- Colouring diamond-free graphs
- Secure total domination in chain graphs and cographs
- Algorithms for unipolar and generalized split graphs
- Triple Roman domination in graphs
- Well-quasi-ordering does not imply bounded clique-width
- The NLC-width and clique-width for powers of graphs of bounded tree-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
- Clique-width for graph classes closed under complementation
- Solving problems on graphs of high rank-width
- On exact solution approaches for the longest induced path problem
- Rank-width: algorithmic and structural results
- Classifying the clique-width of \(H\)-free bipartite graphs
- The recognizability of sets of graphs is a robust property
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
- On structural parameterizations of firefighting
- Mind the independence gap
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)
