Skip to Content
Handbook of Graph Drawing and Visualization
book

Handbook of Graph Drawing and Visualization

by Roberto Tamassia
August 2013
Intermediate to advanced content levelIntermediate to advanced
862 pages
32h 20m
English
Chapman and Hall/CRC
Content preview from Handbook of Graph Drawing and Visualization
5.7. ALGORITHMS FOR DRAWING BINARY TREES 175
Let n be the number of nodes in T . Let 2 A n be any number given as a parameter
to the algorithm.
Figure 5.16 shows the drawing of the tree of Figure 5.13(a) constructed by algorithm
Arbitrary Spine with A =
n, using Lemma 5.1.
Figure 5.16 Drawing of the tree with n = 57 nodes of Figure 5.13(a) constructed by the
Algorithm Arbitrary Spine with A =
n =
57 = 7.55, using Lemma 5.1.
In each recursive step, the algorithm constru c ts a feasible drawing of a subtree T
of T . If
T
has at most A nodes in it, then it constructs a left-corner drawing of T
using Lemma 5.1
such that the drawing has width at most ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Handbook of Graph Theory, 2nd Edition

Handbook of Graph Theory, 2nd Edition

Jonathan L. Gross, Jay Yellen, Ping Zhang
Drawing Product Ideas

Drawing Product Ideas

Kent E. Eisenhuth, Manuel Lima

Publisher Resources

ISBN: 9781420010268