Solving problems on generalized convex graphs via mim-width
From MaRDI portal
Publication:6183361
Cites work
- A unified approach to domination problems on interval graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- An optimal greedy heuristic to color interval graphs
- Approximating clique-width and branch-width
- Boolean-width of graphs
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Bounding the mim‐width of hereditary graph classes
- Circular convex bipartite graphs: feedback vertex sets
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
- Clique-width for hereditary graph classes
- Clique-width of graphs defined by one-vertex extensions
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- Dominating induced matching in some subclasses of bipartite graphs
- Domination in some subclasses of bipartite graphs
- Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Feedback vertex sets on restricted bipartite graphs
- Feedback Vertex Sets on Tree Convex Bipartite Graphs
- Graph classes with structured neighborhoods and algorithmic applications
- Graph Classes: A Survey
- Graph minors. X: Obstructions to tree-decomposition
- Hard coloring problems in low degree planar bipartite graphs
- Hardness of computing width parameters based on branch decompositions over the vertex set
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Independent domination on tree convex bipartite graphs
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
- Linear MIM-width of trees
- List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\)
- List k-colouring P_t-free graphs: a mim-width perspective
- List coloring in the absence of a linear forest
- List Partitions
- Maximum matching in a convex bipartite graph
- Maximum weight induced matching in some subclasses of bipartite graphs
- Mim-width. II. The feedback vertex set problem
- More applications of the d-neighbor equivalence: connectivity and acyclicity constraints
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- On \(H\)-topological intersection graphs
- On list \(k\)-coloring convex bipartite graphs
- On planar supports for hypergraphs
- On the clique-width of some perfect graph classes
- On the thinness and proper thinness of a graph
- Polynomial-time data reduction for the subset interconnection design problem
- Precoloring Extension III: Classes of Perfect Graphs
- Recent developments on graphs of bounded clique-width
- Restricted Bipartite Graphs: Comparison and Hardness Results
- Solving problems on generalized convex graphs via mim-width
- The complexity of colouring problems on dense graphs
- The stable set problem and the thinness of a graph
- Thinness of product graphs
- Tractable connected domination for restricted bipartite graphs
- Tractable feedback vertex sets in restricted bipartite graphs
- Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
- Understanding model counting for -acyclic CNF-formulas
- Upper bounds to the clique width of graphs
Cited in
(8)- Thinness and its variations on some graph families and coloring graphs of bounded thinness
- Approximation hardness of domination problems on generalized convex graphs
- Finding induced subgraphs from graphs with small mim-width
- On the thinness of trees
- Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard
- Finding maximum edge bicliques in tree convex graphs
- Connected partitions via connected dominating sets
- Hamiltonicity parameterized by mim-width Is (indeed) para-NP-hard
This page was built for publication: Solving problems on generalized convex graphs via mim-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183361)
