New branching algorithms solve Cograph Deletion in O*(2.303^k) time and Cograph Editing in O*(4.329^k) time, improving the previous best bounds of O*(2.562^k) and O*(4.612^k).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Faster algorithms for cograph edge modification problems
New branching algorithms solve Cograph Deletion in O*(2.303^k) time and Cograph Editing in O*(4.329^k) time, improving the previous best bounds of O*(2.562^k) and O*(4.612^k).