Papers
Topics
Authors
Recent
Search
2000 character limit reached

Computing the maximum matching width is NP-hard

Published 14 Oct 2017 in cs.DM | (1710.05117v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Kwangjun Ahn 
  2. Jisu Jeong 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up