Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard
From MaRDI portal
Cites work
- A logic-based algorithmic meta-theorem for mim-width
- Bounding the mim‐width of hereditary graph classes
- Classes of intersection digraphs with good algorithmic properties
- Comparing width parameters on graph classes
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Fast Hamiltonicity checking via bases of perfect matchings
- Finding induced subgraphs from graphs with small mim-width
- Graph classes with structured neighborhoods and algorithmic applications
- scientific article; zbMATH DE number 7829295 (Why is no real title available?)
- Linear MIM-width of trees
- 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
- On \(d\)-stable locally checkable problems parameterized by mim-width
- On algorithmic applications of sim-width and mim-width of (H₁,H₂)-free graphs
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
- 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
- XNLP-completeness for parameterized problems on graphs with a linear structure
This page was built for publication: Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229636)
