Deletion and editing to RBMGs are NP-hard; 2-colored editing is FPT via bicluster editing reduction; modification to hierarchically colored cographs is NP-complete.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity of Modification Problems for Reciprocal Best Match Graphs
Deletion and editing to RBMGs are NP-hard; 2-colored editing is FPT via bicluster editing reduction; modification to hierarchically colored cographs is NP-complete.