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
8.4. RESULTS IN THE CONSTRAINED SCENARIOS 267
given overlaps. But this means t o find a layout of the bipartite graph on two straight lines
such that there is no edge crossing. In other words, the problem of reconstructing the two
orders of the intervals in A and B is equivalent to the problem of c omput in g an upright
2-spine, 0-bend drawing of the bipartite graph representing th e overlaps. Waterman and
Griggs study th e properties of thi s bipartit e graph, prove that it is a caterpillar and give a
linear-time algorithm to compute an upright 2-spine, 0-bend drawing.
Remaining in t he case of upright drawings, when the number of spines is greater ...
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