Finding induced subgraphs from graphs with small mim-width
From MaRDI portal
Cites work
- A logic-based algorithmic meta-theorem for mim-width
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
- A width parameter useful for chordal and co-comparability graphs
- Bounding the mim‐width of hereditary graph classes
- Complexity of the cluster vertex deletion problem on \(H\)-free graphs
- Difference graphs
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Geometric algorithms and combinatorial optimization
- Graph classes with structured neighborhoods and algorithmic applications
- Hardness of computing width parameters based on branch decompositions over the vertex set
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- Linear time solvable optimization problems on graphs of bounded clique-width
- List k-colouring P_t-free graphs: a mim-width perspective
- Lower bounds on the mim-width of some graph classes
- Mim-width. I. Induced path problems
- Mim-width. II. The feedback vertex set problem
- Mim-width. III. Graph powers and generalized distance domination problems
- More applications of the d-neighbor equivalence: acyclicity and connectivity constraints
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Node-Deletion Problems on Bipartite Graphs
- On algorithmic applications of sim-width and mim-width of (H₁,H₂)-free graphs
- On the \(d\)-claw vertex deletion problem
- On the tractability of optimization problems on \(H\)-graphs
- Rank-width and vertex-minors
- Reducing the domination number of graphs via edge contractions and vertex deletions
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Solving problems on generalized convex graphs via mim-width
- Structural parameterizations of b-coloring
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The node-deletion problem for hereditary properties is NP-complete
- The strong perfect graph theorem
- Understanding model counting for -acyclic CNF-formulas
- Vertex deletion problems on chordal graphs
Cited in
(4)
This page was built for publication: Finding induced subgraphs from graphs with small mim-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891104)
