Computational search of small point sets with small rectilinear crossing number
Work
Year: 2014
Type: article
Abstract: Let cr(Kn) be the minimum number of crossings over all rectilinear drawings of the complete graph on n vertices in the plane. In this paper we prove that cr(Kn) < 0:380473 n + ( n 3 ); improving thus ... more
Authors Ruy Fabila‐Monroy, Jorge López
Cites: 9
Cited by: 20
Related to: 10
FWCI: 3.855
Citation percentile (by year/subfield): 93.15
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond