SS21_VG: 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.

Klicken Sie auf 'Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely', um die Ressource zu öffnen.

Impressum | Datenschutzerklärung - WueCampus | Erklärung zur Barrierefreiheit | Bildnachweise

Navigationsleiste - WueStudy: University icons created by justicon - Flaticon
Navigationsleiste - Rechenzentrum: Data center icons created by Eucalyp - Flaticon
Navigationsleiste - Website Support: Consultant icons created by Vitaly Gorbachev - Flaticon
Navigationsleiste - Häufige Fragen: Files and folders icons created by Freepik - Flaticon
Navigationsleiste - Lehre Digital: Training icons created by vectorspoint - Flaticon
Navigationsleiste - Forschung Digital: Research icons created by Eucalyp - Flaticon
Navigationsleiste - Lecture: Video icons created by Freepik - Flaticon
Werbefeld 2 - WueLogin: Login icons created by Freepik - Flaticon
Werbefeld 3 - Upgrade WueCampus 4.4: Update icons created by Freepik - Flaticon