On the Relationship Between Clique-Width and Treewidth
From MaRDI portal
(Redirected from Publication:5317177)
Recommendations
Cited in
(96)- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Structural parameterizations of b-coloring
- Regular independent sets
- Acyclic coloring parameterized by directed clique-width
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Vertex cover meets scheduling
- The Treewidth and Pathwidth of Graph Unions
- Treewidth versus clique number. II: Tree-independence number
- Comparing width parameters on graph classes
- A new representation of proper interval graphs with an application to clique-width
- Low-congestion shortcut and graph parameters
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Graphs of separability at most 2
- Polynomial-time recognition of clique-width 3 graphs
- Stability, vertex stability, and unfrozenness for special graph classes
- Boolean-width of graphs
- scientific article; zbMATH DE number 7656024 (Why is no real title available?)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- Recent developments on graphs of bounded clique-width
- On the approximate compressibility of connected vertex cover
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
- 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
- Twin-width can be exponential in treewidth
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Structure and algorithms for (cap, even hole)-free graphs
- Eigenvalue location in graphs of small clique-width
- (Total) vector domination for graphs with bounded branchwidth
- Subexponential fixed-parameter algorithms for partial vector domination
- Parameterized complexity of geodetic set
- Compact representation of graphs of small clique-width
- On the Boolean-width of a graph: structure and applications
- scientific article; zbMATH DE number 2044924 (Why is no real title available?)
- Between treewidth and clique-width
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- The effect of planarization on width
- Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
- On powers of graphs of bounded NLC-width (clique-width)
- Alliances in graphs of bounded clique-width
- On the minimum cycle cover problem on graphs with bounded co-degeneracy
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Bounding clique-width via perfect graphs
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- Boolean-width of graphs
- Dominating induced matchings in graphs without a skew star
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Rank-width and tree-width of \(H\)-minor-free graphs
- Graphs of separability at most two: structural characterizations and their consequences
- Clique‐width: Harnessing the power of atoms
- Open problems on graph coloring for special graph classes
- Line graphs of bounded clique-width
- MSO undecidability for hereditary classes of unbounded clique-width
- Subexponential fixed-parameter algorithms for partial vector domination
- On the model-checking of monadic second-order formulas with edge set quantifications
- Graph operations characterizing rank-width
- Maximum matching in almost linear time on graphs of bounded clique-width
- Parameterized Complexity of Graph Burning
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Parameterized complexity of graph burning
- Graph classes with and without powers of bounded clique-width
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
- Comparison of k-creature and t-critter
- From tree-decompositions to clique-width terms
- Approximating clique-width and branch-width
- The relative clique-width of a graph
- The effect of planarization on width
- Rank-width: algorithmic and structural results
- Circle graphs and monadic second-order logic
- On treewidth and maximum cliques
- On quasi-planar graphs: clique-width and logical description
- Bounding clique-width via perfect graphs
- Word-representable graphs and locality of words
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Treewidth versus clique number in graph classes with a forbidden structure
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Multi-clique-width
- Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
- Linear clique-width for hereditary classes of cographs
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
- On the structure of (pan, even hole)-free graphs
- Bounding the clique-width of H-free chordal graphs
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- Parameterized Complexity of Geodetic Set
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
- Vertex-minor reductions can simulate edge contractions
- Between treewidth and clique-width
- The behavior of clique-width under graph operations and graph transformations
- Cliquewidth and knowledge compilation
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Latency-bounded target set selection in social networks
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Polynomial algorithms for protein similarity search for restricted mRNA structures
- Optimal centrality computations within bounded clique-width graphs
This page was built for publication: On the Relationship Between Clique-Width and Treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317177)
