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
13.3. LAYER ASSIGNMENT 419
model of the problem and a specific network simplex algorithm for solving it which although
not proven polynomial-time finds a layering with the minimum number of dummy vertices
reportedly fast [GKNV93].
Other parameters of a layering that reflect on the quality of the drawing are the width
and the height of a layering and the edge density between adjacent layers. The height of a
layering is the number of layers, and the width is the maximum number of vertices in a layer.
Usually these two parameters are used to approximate the dimensions of the final drawing.
When measuring the width of a layering the contribution of the dummy vertices may or may
not be taken into account. A more precise definition of the layering width tak
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