  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.
