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
290 CHAPTER 9. CIRCULAR DRAWING ALGORITHMS
u
xv w
u
(b)
xv w
v w
(a)
u
u
v w
u
xv w
counter = i + 1
counter = i
After Step 12
u
v w
counter = i
counter = i + 1
After Step 12
14
14
Figure 9.5 The node and edge absorption qualities of Algorithm CIRCULAR. Part (a)
shows a degree-two node u and its neighbors v and w at three different points in the algo-
rithm. Fi r s t, the pair edge established by u, (v, w), is shown. Next, after node u is processed,
node u and edges (u, v) and (u, w) are inherently represented by the edge (v, w). Finally, we
see the same graph fragment after the pair edge (v, w) has been removed in Ste p 14. Part (b)
shows a similar example with a degree-thre ...
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