Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely
Conditions d’achèvement
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.
Cliquer sur Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely pour ouvrir la ressource.