Computing the maximum matching width is NP-hard
Kwangjun Ahn, Jisu Jeong
TL;DR
This paper proves that determining the maximum matching width of a graph, a parameter related to branch-decompositions, is an NP-hard problem, indicating computational difficulty.
Contribution
It establishes the NP-hardness of computing the maximum matching width, a previously unproven complexity result for this graph parameter.
Findings
Maximum matching width computation is NP-hard.
The result impacts algorithms relying on this parameter.
Provides a foundation for future complexity studies.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Limits and Structures in Graph Theory