On crossing numbers of geometric proximity graphs
From MaRDI portal
Publication:632725
DOI10.1016/j.comgeo.2010.11.003zbMath1213.05179OpenAlexW2071138894MaRDI QIDQ632725
Bernardo M. Ábrego, Maria Saumell, Vera Sacristán, David Flores-Peñaloza, Ferran Hurtado, Ruy Fabila-Monroy, Silvia Fernández-Merchant
Publication date: 25 March 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.11.003
Related Items (5)
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω ⋮ Graph product structure for non-minor-closed classes ⋮ On the edge crossing properties of Euclidean minimum weight Laman graphs ⋮ Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Improving the crossing lemma by finding more crossings in sparse graphs
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
- Graphs drawn with few crossings per edge
- New bounds on crossing numbers
- Higher order Delaunay triangulations
- Improved \(k\)-nearest neighbor classification
- Optimization for first order Delaunay triangulations
- Planar decompositions and the crossing number of graphs with an excluded minor
- Research Problems in Discrete Geometry
- Crossing Number is NP-Complete
- ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
- A central approach to bound the number of crossings in a generalized configuration
- Improved upper bounds on the crossing number
- Crossing-Free Subgraphs
- Towards a Theory of Geometric Graphs
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- On a problem of P. Turan concerning graphs
This page was built for publication: On crossing numbers of geometric proximity graphs
