Login / Signup
Computing the maximum matching width is NP-hard.
Kwangjun Ahn
Jisu Jeong
Published in:
CoRR (2017)
Keyphrases
</>
maximum matching
np hard
bipartite graph
stable set
linear programming
lower bound
special case
scheduling problem
approximation algorithms
worst case
integer programming
computational complexity
closely related
decision problems
neural network
natural language processing