Computing the maximum matching width is NP-hard
classification
💻 cs.DM
keywords
widthmatchingmaximumcomputinggraphnp-hardbranch-decompositiondefined
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.