Skip to Main 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
548 CHAPTER 17. THE OPEN GRAPH DRAWING FRAMEWORK (OGDF)
the triconnected components (called the skeletons of the tree nodes) of the graph: S-nodes
correspond to serial structures, P-nodes to parallel structures, and R-nodes to simple, tri-
connected structures; Q-nodes simply correspond to the edges in the graph and are hence
not required by an implementation. Both data structures can be build in linear time; the
latter constructs the SPQR-tree by applying the corrected version [GM01] of Hopcroft and
Tarjan’s algorithm [HT73a] for decomposing a graph into its triconnected components. The
OGDF is one of the few places where one can find a correct implementation of this complex
and involved algorithm (to the best of our knowledge, AGD was the first
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