A transfer theorem for boundary classes under bi-reductions is stated, but its converse is incomplete and several claimed new boundary classes apply only to restricted problem variants.
On the complexity of the dominating induced matching problem in hereditary classes of graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Reducibility among NP-Hard graph problems and boundary classes
A transfer theorem for boundary classes under bi-reductions is stated, but its converse is incomplete and several claimed new boundary classes apply only to restricted problem variants.