33 search results - page 7 / 7 » Crossing-critical graphs with large maximum degree |
146
click to vote
APCSAC
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
178
click to vote
APPROX
2009
Springer
16 years 18 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
161
click to vote
TVCG
2008
15 years 5 months ago
2008
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...