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
12.6. LARGE GRAPHS 393
Main Algorithm
create a filtration V : V
0
V
1
. . . V
k
for i = k to 0 do
for each v V
i
V
i+1
do
find vertex neighborhood N
i
(v), N
i1
(v), . . . , N
0
(v)
find initial position pos[v] of v
repeat rounds times
for each v V
i
do
compute local temperature heat[v]
disp[v] heat[v] ·
−→
F
N
i
(v)
for each v V
i
do
pos[v] pos[v] + disp[v]
add all edges e E
Figure 12.6 Pse ud o-code for the algorithm by Gajer et al. [GGK04].
The 2000 algorithm of Gajer et al. [G G K 04], shown in Figure 12.6, is also a multi-
scale f orc e- directed algorithm but introdu ce s several ideas to the realm of multi-scale force-
directed algorithms for large graphs. ...
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