Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,216,482 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
44 relations
1-planar graph
Albertson conjecture
Angular resolution (graph drawing)
Approximation algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Life-time monitoring of in service switches and crossings through field experimentation
A. Cornish
2014
Corpus ID: 106972623
2012
2012
On some knot energies involving Menger curvature
Pawel Strzelecki
,
Marta Szuma'nska
,
H. Mosel
2012
Corpus ID: 119315000
2010
2010
A Force-Directed Method for Large Crossing Angle Graph Drawing
P. Eades
,
Weidong Huang
,
Seok-Hee Hong
arXiv.org
2010
Corpus ID: 378895
Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However…
Expand
2007
2007
Parallelisation of genetic algorithms for the 2-page crossing number problem
Hongmei He
,
O. Sýkora
,
A. Sălăgean
,
E. Mäkinen
J. Parallel Distributed Comput.
2007
Corpus ID: 206389898
2005
2005
Non-planar core reduction of graphs
Markus Chimani
,
Carsten Gutwenger
Discrete Mathematics
2005
Corpus ID: 16617660
Highly Cited
2001
Highly Cited
2001
Quantitative description of vessel features in hypertensive retinopathy fundus images
M. Foracchia
,
E. Grisan
,
A. Ruggeri
2001
Corpus ID: 68103084
Methods. High resolution digital images of fundus are directly acquired from fundus cameras or scanned from slides. At first the…
Expand
Highly Cited
2000
Highly Cited
2000
Optical interconnection using VCSELs and polymeric waveguide circuits
T. Sakamoto
,
H. Tsuda
,
M. Hikita
,
T. Kagawa
,
K. Tateno
,
C. Amano
Journal of Lightwave Technology
2000
Corpus ID: 196276
We investigated the waveguide loss and transmission characteristics for optical interconnection using vertical-cavity surface…
Expand
2000
2000
ON EGGLETON AND GUY'S CONJECTURED UPPER BOUND FOR THE CROSSING NUMBER OF THE n-CUBE
L. Faria
,
Herrera De FlGUEIREDO
,
M. Škoviera
2000
Corpus ID: 18723266
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…
Expand
1997
1997
Efficient VLSI Layouts for Homogeneous Product Networks
Antonio Fernández
,
K. Efe
IEEE Trans. Computers
1997
Corpus ID: 437770
In this paper, we develop generalized methods to layout homogeneous product networks with any number of dimensions, and analyze…
Expand
1991
1991
The crossing distribution problem
M. Marek-Sadowska
,
M. Sarrafzadeh
IEEE International Conference on Computer-Aided…
1991
Corpus ID: 1452449
The authors study the problem of 'properly' distributing the set of crossings (i.e., intersection of nets) of a given global…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE