On the complexity of minimum maximal acyclic matchings
Juhi Chaudhary,
Sounaka Mishra,
B. S. Panda
Abstract:Low-Acy-Matching asks to find a maximal matching M in a given graph G of minimum cardinality such that the set of M-saturated vertices induces an acyclic subgraph in G. The decision version of Low-Acy-Matching is known to be $${\textsf{NP}}$$
NP
-complete. In this paper, we strengthen this result by proving that the decision version of Low-Acy-Matching remains $${\textsf{NP}}$$
NP
-complete for bipartite graphs with maximum degree 6 and planar… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.