On complexity of special maximum matchings constructing
classification
💻 cs.DM
keywords
maximummatchingbipartiteboundcardinalitycomplexityconstructingexistence
read the original abstract
For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality of its maximum matching.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.