Skip to search formSkip to main contentSkip to account menu

Crossing number (graph theory)

Known as: Crossing number 
In graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However… 
Highly Cited
2001
Highly Cited
2001
Methods. High resolution digital images of fundus are directly acquired from fundus cameras or scanned from slides. At first the… 
Highly Cited
2000
Highly Cited
2000
We investigated the waveguide loss and transmission characteristics for optical interconnection using vertical-cavity surface… 
2000
2000
The crossing number v(G) of a graph G is the smallest integer such that there is a drawing for G with v(G) crossings of edges… 
1997
1997
In this paper, we develop generalized methods to layout homogeneous product networks with any number of dimensions, and analyze… 
1991
1991
The authors study the problem of 'properly' distributing the set of crossings (i.e., intersection of nets) of a given global…