Pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DS 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Faster algorithms for cograph edge modification problems

cs.DS · 2019-08-03 · conditional · novelty 6.0

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).

citing papers explorer

Showing 1 of 1 citing paper.

  • Faster algorithms for cograph edge modification problems cs.DS · 2019-08-03 · conditional · none · ref 5

    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).