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 429
Although the longest-path algorithm finds layerings with the minimum number of layers
and the Coffman-Graham algorithm finds layerings with a pre-specified maximum number
of vertices in a layer, their layerings typically lead to drawings which occupy large drawing
area and have too many long edges.
For a compact layering, the network simplex algorithm of Gansner et al., described in
Section 13.3.2, is probably the best fast solution. It finds layerings with the minimum
number of dummy vertices which are also very compact in general. However, there are
particular patterns in graph that may make the network simplex layering either too wide or
too long. The branch-and-cut algorithm of Healy and Nikolov, outlined in Section 13.3.2, ...
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