Clique-width: on the price of generality
From MaRDI portal
Publication:4633895
Recommendations
Cited in
(39)- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Directed NLC-width
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Efficient parallel algorithms for parameterized problems
- Parameterized complexity for iterated type partitions and modular-width
- On the Relationship Between Clique-Width and Treewidth
- On the computational difficulty of the terminal connection problem
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
- Clique-width minimization is NP-hard
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- Recent developments on graphs of bounded clique-width
- An extension of the bivariate chromatic polynomial
- Algorithmic applications of tree-cut width
- Planar capacitated dominating set is \(W[1]\)-hard
- scientific article; zbMATH DE number 2044924 (Why is no real title available?)
- Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth
- Between treewidth and clique-width
- Clique-width. III: Hamiltonian cycle and the odd case of graph coloring
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- Oriented coloring on recursively defined digraphs
- On the minimum cycle cover problem on graphs with bounded co-degeneracy
- Clique-width is NP-complete
- Tight complexity bounds for FPT subgraph problems parameterized by clique-width
- New graph classes of bounded clique-width
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
- Methods for determining cycles of a specific length in undirected graphs with edge weights
- Confronting intractability via parameters
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Critical properties of graphs of bounded clique-width
- On digraph width measures in parameterized algorithmics
- Intractability of clique-width parameterizations
- Algorithmic lower bounds for problems parameterized by clique-width
- Iterated Type Partitions
- Optimizing concurrency under Scheduling by Edge Reversal
- Clique-width: when hard does not mean impossible
- Multi-clique-width
- Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
- Between treewidth and clique-width
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
This page was built for publication: Clique-width: on the price of generality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633895)
