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
310 CHAPTER 9. CIRCULAR DRAWING ALGORITHMS
Figure 9.30 A DFS tree with the edges of the longest path d es ignate d by thick lines.
Figure taken from [ST99, ST06].
embedding circle. As noted in the time complexity analysis of Algorit h m CIRCULAR-
Postprocessing, the order is dominated by the time required for counting the number of
crossings. Therefore, it is vitally important to the time efficiency of th e implementation of
this algorithm that the number of crossings be counted in an effective manner. In order to
lower t he average time cost of counting cross in gs in the drawing, we ignore all edges that
lie on the periphery of the embed d ing circle. ...
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