Computing the maximum matching width is NP-hard

10/14/2017
by   Kwangjun Ahn, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2018

Characterizations and Directed Path-Width of Sequence Digraphs

Computing the directed path-width of a directed graph is an NP-hard prob...
research
07/09/2019

Linear MIM-Width of Trees

We provide an O(n log n) algorithm computing the linear maximum induced ...
research
03/16/2021

Classification of OBDD size for monotone 2-CNFs

We introduce a new graph parameter called linear upper maximum induced m...
research
07/28/2023

Three remarks on 𝐖_2 graphs

Let k ≥ 1. A graph G is 𝐖_𝐤 if for any k pairwise disjoint independent v...
research
08/21/2017

On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs

Minimum Bisection denotes the NP-hard problem to partition the vertex se...
research
08/21/2017

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter

Minimum k-Section denotes the NP-hard problem to partition the vertex se...
research
09/22/2020

Computing L(p,1)-Labeling with Combined Parameters

Given a graph, an L(p,1)-labeling of the graph is an assignment f from t...

Please sign up or login with your details

Forgot password? Click here to reset