Mim-Width is paraNP-complete
Computational Complexity
2025-01-13 v1 Discrete Mathematics
Data Structures and Algorithms
Combinatorics
Abstract
We show that it is NP-hard to distinguish graphs of linear mim-width at most 1211 from graphs of sim-width at least 1216. This implies that Mim-Width, Sim-Width, One-Sided Mim-Width, and their linear counterparts are all paraNP-complete, i.e., NP-complete to compute even when upper bounded by a constant.
Keywords
Cite
@article{arxiv.2501.05638,
title = {Mim-Width is paraNP-complete},
author = {Benjamin Bergougnoux and Édouard Bonnet and Julien Duron},
journal= {arXiv preprint arXiv:2501.05638},
year = {2025}
}
Comments
27 pages, 9 figures