Computing the maximum matching width is NP-hard
K. Ahn, Jisu Jeong · arXiv (Cornell University) · 2017
The maximum matching width is a graph width parameter that is defined on a branch-decomposition over the vertex set of a graph. In this short paper, we prove that the problem of computing the maximum matching width is NP-hard.