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
414 CHAPTER 13. HIERARCHICAL DRAWING ALGORITHMS
13.2.1 Heuristics Based on Vertex Orderings
As we mentioned above any linear ordering of the vertices provides two FSs. Imagine the
vertices placed on a horizontal line in accordance with the provided linear ordering. The
first FS consists of the edges with direction from left to right, and the second FS consists
of the edges with direction from right to left. It can be shown that there are digraphs and
linear orderings of the vertices for which both FSs have the same size [BS90]. Thus, the
simple approach is a 2-approximation heuristic for solving both the minimum FS and FAS
problems.
It is clear that the outcome of this simple approach depends on the linear ordering of the
vertices. Some researchers hav ...
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