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. Forum
    3. Ricerca avanzata
    4. Sommersemester 2020
    5. Master- und Aufbaustudiengänge
    6. Informatik
     

    Kursinformationen

     Kursbeschreibung

    This course discusses the most important algorithms for graph drawing. Many methods are imported from the Algorithmic Graph Theory lecture; such as: divide and conquer, network flows, integer programming and the planar separator theorem. We will discuss measures of the quality of graph drawings and algorithms to optimize them.

     Lehrende

    Philipp Kindermann
    Jonathan Klawitter
    MK
    Myroslav Kryven
    Alexander Wolff

    |

    SS20: Visualisierung von Graphen

    Si prega di inserire i termini di ricerca in uno o più dei seguenti campi:
    Contatta il supporto
    Ospite (Login)
    Ottieni l'app mobile
    Impressum + Datenschutzerklärung + Erklärung zur Barrierefreiheit
    Powered by Moodle