Linear time solvable optimization problems on graphs of bounded clique width
From MaRDI portal
Recommendations
Cited in
(25)- On variations of \(P_{4}\)-sparse graphs
- Clique-width of partner-limited graphs
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps
- Conjunctive-query containment and constraint satisfaction
- Linear time solvable optimization problems on graphs of bounded clique-width
- The complexity of frugal colouring
- A logic-based approach to incremental reasoning on multi-agent systems
- scientific article; zbMATH DE number 992954 (Why is no real title available?)
- On -sparse graphs and other families
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
- scientific article; zbMATH DE number 1161294 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Target Set Selection in Dense Graph Classes
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- On the clique-width of graph with few \(P_{4}\)'s
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Algorithmic uses of the Feferman-Vaught theorem
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
- How I got to like graph polynomials
- My writing
- Polynomial-time recognition and maximum independent set in Burling graphs
- Sparse induced subgraphs in P₇-Free graphs of bounded clique number
- New graph classes of bounded clique-width
- Parameterized power domination complexity
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 Q4232773)
