Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912640795672576 |
|---|---|
| author | Bergougnoux, Benjamin Jaffke, Lars |
| author_facet | Bergougnoux, Benjamin Jaffke, Lars |
| contents | We prove that Hamiltonian Path and Hamiltonian Cycle are NP-hard on graphs of linear mim-width 26, even when a linear order of the input graph with mim-width 26 is provided together with input. This fills a gap left by a broken proof of the para-NP-hardness of Hamiltonicity problems parameterized by mim-width. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_00612 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard Bergougnoux, Benjamin Jaffke, Lars Computational Complexity Data Structures and Algorithms 68Q17, 68Q25, 68Q27 We prove that Hamiltonian Path and Hamiltonian Cycle are NP-hard on graphs of linear mim-width 26, even when a linear order of the input graph with mim-width 26 is provided together with input. This fills a gap left by a broken proof of the para-NP-hardness of Hamiltonicity problems parameterized by mim-width. |
| title | Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard |
| topic | Computational Complexity Data Structures and Algorithms 68Q17, 68Q25, 68Q27 |
| url | https://arxiv.org/abs/2507.00612 |