Ir para o conteúdo principal
WueCampus
  • Mais
    Português - Portugal ‎(pt)‎
    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)‎
    Está a utilizar acesso de visitante
    Entrar
    1. Página principal
    2. Sommersemester 2020
    3. Master- und Aufbaustudiengänge
    4. SS20_VG
    5. Literatur und zusätzliche Materialien
    6. Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely

    Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely

    This paper shows that one can use LP-based methods to minimize the width of a "balanced-layered" drawing of tree, but if one desires a grid drawing the problem becomes NP-hard. 

    Clique em Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely para abrir o recurso.
    ◄ Lecture #1 [Reingold and Tilford 1981] Tidier Drawings of Trees
    Lecture #3 [Schnyder 1990] Embedding Planar Graphs on the Grid ►
    Está a utilizar acesso de visitante (Entrar)
    Obter a Aplicação móvel
    Impressum + Datenschutzerklärung + Erklärung zur Barrierefreiheit
    Fornecido por Moodle