Tight bounds for connected odd cycle transversal parameterized by clique-width
From MaRDI portal
Cites work
- A tight Monte-Carlo algorithm for Steiner tree parameterized by clique-width
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Computing the chromatic number using graph decompositions via matrix rank
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Fast exact algorithms for some connectivity problems parameterized by clique-width
- Fast Hamiltonicity checking via bases of perfect matchings
- Fast Zeta Transforms for Lattices with Few Irreducibles
- Finer tight bounds for coloring on clique-width
- Fourier meets M\"{o}bius: fast subset convolution
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- Known algorithms on graphs of bounded treewidth are probably optimal
- Linear rank-width and linear clique-width of trees
- Lower bounds for dynamic programming on planar graphs of bounded cutwidth
- Matching is as easy as matrix inversion
- On the complexity of k-SAT
- On the equivalence among problems of bounded width
- On the Relationship Between Clique-Width and Treewidth
- On the relationship between NLC-width and linear NLC-width
- Parameterized algorithms
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- The fine-grained complexity of graph homomorphism parameterized by clique-width
- Tight algorithms for connectivity problems parameterized by clique-width
- Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
- Tight bounds for connectivity problems parameterized by cutwidth
- Tight bounds for counting colorings and connected edge sets parameterized by cutwidth
- Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
- Towards exact structural thresholds for parameterized complexity
- Upper bounds to the clique width of graphs
- Vertex disjoint paths on clique-width bounded graphs
- Which problems have strongly exponential complexity?
This page was built for publication: Tight bounds for connected odd cycle transversal parameterized by clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356343)
