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
102 CHAPTER 3. SYMMETRIC GRAPH DRAWING
To state the algorithm, we need some more terminology. We say that a vir tu al edge e of
skeleton(v) is a parent (child) virtual edge if e cor r es ponds to a virtual edge of u which is
a parent (resp. child) node of v. We define a parent separation pair s = (s
1
, s
2
) of v as the
two endpoints of a parent virt ual edge e.
The overall algorithm is composed of three steps.
Algorithm MAX
PAG bicon
Step 1. Construct the SPQR-t r ee T of G.
Step 2. Reduction: For each level i of T (from the lowest level to the root level)
(a) For each leaf node on level i, compute labels on the parent virtual edge in
the leaf node.
(b)
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