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
342 CHAPTER 10. RECTANGULAR DRAWING ALGORITHMS
There are infinitely many cycles with four designated vertices for which the sum of the
width and the height of any box-rectangular drawing of the cycles is m 2.
The rest of this section deals with a general case where no vertices are designated as corner
boxes in advance. Then our problem is how to examine whether G has some set of outer
vertices such that there is a box-rectangular drawing of G having them as the corner boxes,
and how to find them if there are. We first present a necessary and sufficient condition
for a plane graph G with 3 to have a box-rectangular drawing D as in Theorem 10.7
[RNN00], ...
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