449 search results - page 53 / 90 » Degenerate crossing numbers |
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
APIN
2010
14 years 10 months ago
2010
Abstract. This paper introduces a robust variant of AdaBoost, cwAdaBoost, that uses weight perturbation to reduce variance error, and is particularly effective when dealing with da...
JGT
2006
14 years 9 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...
MICCAI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. In analyzing diffusion magnetic resonance imaging, multitensor models address the limitations of the single diffusion tensor in situations of partial voluming and fiber c...
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...