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
424 CHAPTER 13. HIERARCHICAL DRAWING ALGORITHMS
add vertices to the current layer which will reduce widthCurrent. If d
+
(v) < 1 then the
assignment of v to the current layer increases widthCurrent because it does not replace
any dummy vertices. This is an indication that widthCurrent can not be reduced further.
The min-width layering algorithm has the same time complexity as the longest-path
algorithm which has been shown to run in linear time [Ulm75]. Through an extensive
computational study Tarassov et al. have determined that the narrowest layerings are
found for 1 U BW 4 and 1 c 2. Thus, they propose to run the algorithm for
UBW {1, 2, 3, 4} and c {1, 2}, choose the narrowest of the eight layerings and apply to
it vertex-promotion
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