396 search results - page 6 / 80 » Crossing Numbers |
ENDM
2008
14 years 9 months ago
2008
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
115
click to vote
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
SIAMCOMP
2000
14 years 9 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
100
click to vote
SOFSEM
2005
Springer
15 years 3 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...