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
434 CHAPTER 13. HIERARCHICAL DRAWING ALGORITHMS
general crossing minimization problem, where permutations for both layers that minimize
the number of crossings are required, is NP -hard [GJ83]; even if one layer is fixed, the
problem still remains N P -hard [EW94]. To counter these apparently negative results,
several heuristic and exact methods have been proposed.
While we will mainly be concerned with algorithms that find a drawing with few crossings,
the decision version of the problem [GJ83, EW94] also is of interest. In particular, fixed-
parameter tractable algorithms have been developed to answer the question of whether an
ordering of the vertices on one “shore” of a bipartite graph admits a k-crossing (or less)
solution when the vertices of
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