Computing the maximum matching width is NP-hard
Discrete Mathematics
2017-10-17 v1
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.
Keywords
Cite
@article{arxiv.1710.05117,
title = {Computing the maximum matching width is NP-hard},
author = {Kwangjun Ahn and Jisu Jeong},
journal= {arXiv preprint arXiv:1710.05117},
year = {2017}
}
Comments
5 pages; 1 figure