Skip to main content
WueCampus
  • More
    English ‎(en)‎
    Català ‎(ca)‎ Deutsch ‎(de)‎ Deutsch (du) ‎(de_du)‎ English ‎(en)‎ Español - Internacional ‎(es)‎ Français ‎(fr)‎ Italiano ‎(it)‎ Português - Portugal ‎(pt)‎ Svenska ‎(sv)‎ Türkçe ‎(tr)‎ Русский ‎(ru)‎ العربية ‎(ar)‎
    You are currently using guest access
    Log in
    1. Home
    2. WS20_AdvAlg
    3. Literatur und zusätzliche Materialien
    4. [BS '05] On the computational complexity of the rooted subtree prune and regraft distance

    [BS '05] On the computational complexity of the rooted subtree prune and regraft distance

    Click on [BS '05] On the computational complexity of the rooted subtree prune and regraft distance to open the resource.
    ◄ [GW '95] Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    [RSW '06] The maximum agreement forest problem: Approximation algorithms and computational experiments ►
    You are currently using guest access (Log in)
    Get the mobile app
    Impressum + Datenschutzerklärung + Erklärung zur Barrierefreiheit
    Powered by Moodle