GD
2007
Springer
14 years 5 months ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
GD
2007
Springer
14 years 5 months ago
2007
Springer
We add two minimum level nonplanar (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [3]. Neither of these patterns match any of the previous pat...
GD
2007
Springer
14 years 5 months ago
2007
Springer
GD
2007
Springer
14 years 5 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
GD
2007
Springer
14 years 5 months ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
GD
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...
GD
2007
Springer
14 years 5 months ago
2007
Springer
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...
GD
2007
Springer
14 years 5 months ago
2007
Springer
We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of ...
GD
2007
Springer
14 years 5 months ago
2007
Springer
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
GD
2007
Springer
14 years 5 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...