New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth
From MaRDI portal
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth
Cites work
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Approximating clique-width and branch-width
- Boolean-width of graphs
- Bounding the mim‐width of hereditary graph classes
- Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time
- Graph minors. III. Planar tree-width
- Graph theory
- Handle-rewriting hypergraph grammars
- Large Induced Subgraphs via Triangulations and CMSO
- Linear time solvable optimization problems on graphs of bounded clique-width
- List k-colouring P_t-free graphs: a mim-width perspective
- Mim-width. I. Induced path problems
- Mim-width. II. The feedback vertex set problem
- Mim-width. III. Graph powers and generalized distance domination problems
- Minor-matching hypertree width
- On algorithmic applications of sim-width and mim-width of (H₁,H₂)-free graphs
- Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs
- Treewidth versus clique number in graph classes with a forbidden structure
Cited in
(5)- Excluding a clique or a biclique in graphs of bounded induced matching treewidth
- Comparing width parameters on graph classes
- Tree decompositions meet induced matchings: beyond max weight independent set
- Tree decompositions meet induced matchings: beyond max weight independent set
- Mim-width is paraNP-complete
This page was built for publication: New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496543)
