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
58 CHAPTER 2. CROSSINGS AND PLANARIZATION
a
b
c d
e
f
g
h
i
j
k
l
m
n
o
p
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
Figure 2.8 An optimal drawing of a graph with two crossings (left) and an optimal simple
drawing of the same graph with three crossings (right). Both drawings were produced with
the exact algorithm presented in this section.
u v
u v
d
1
d
2
d
l-1
d
l-2
Figure 2.9 Edges are replaced with a path of le ngth by inserting 1 dummy vertices.
Given an integer and a graph G = (V, E) such that |E|, we can create a graph
G
= (V
, E
) by replacing every edge e E with a path of length . Figure 2.9 sh ows
an example that illustrates this transformation. The graph G
contains a total
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