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
15.3. SOLVING THE LABELING PROBLEM 509
a
d
c
b
Matching graph
Source
Target
Objects to be labeled
Clusters of overlapping labels
Figure 15.19 The fl ow graph . Figure taken from [KT06].
Clearly a maximum flow of graph G
flow
will produce a maximum cardinality labe l as-
signment with re spect to the set of labels encode d in the matching graph. Sophisticated
techniques can solve the maximum flow problem in O(nm log n) time [AMO93], where n is
the number of vertices and m is the number of edges of the flow graph.
This technique is summarized in the algorithm of Figur e 15.20.
Flow-based Algorithm
INPUT: A drawing Γ, a set of graphical features F in Γ to be labeled, ...
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