Work

Computing the maximum matching width is NP-hard

Year: 2017

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1710.05117

Authors: Ahn, Kwangjun, Jeong, Jisu

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2765346054

Cites: 5

Cited by:

Related to: 10