Vai al contenuto principale
WueCampus
  • Altro
    Italiano ‎(it)‎
    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)‎
    Ospite
    Login
    1. Home
    2. Wintersemester 2020/2021
    3. Master- und Aufbaustudiengänge
    4. WS20_AdvAlg
    5. Literatur und zusätzliche Materialien
    6. [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

    Per aprire la risorsa fai click sul link [BS '05] On the computational complexity of the rooted subtree prune and regraft distance
    ◄ [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 ►
    Ospite (Login)
    Ottieni l'app mobile
    Impressum + Datenschutzerklärung + Erklärung zur Barrierefreiheit
    Powered by Moodle