1 problem

The mim-width hardness conjecture for NP-hard distance $(\sigma,\rho)$ problems
arXiv@arxiv
Mim-width hardness conjecture. Every $\NP$ -hard distance $(\sigma,\rho)$ problem is $\W[1]$ -hard when parameterized by mim-width.
Conjectureopengraph-domination mim-width parameterized-complexity
1

The mim-width hardness conjecture for NP-hard distance (σ,ρ)(\sigma,\rho)(σ,ρ) problems