Computational search of small point sets with small rectilinear crossing number

DOI10.7155/jgaa.00328zbMath1295.05162arXiv1403.1288OpenAlexW2963030908MaRDI QIDQ5494864

No author found.

Publication date: 30 July 2014

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1288

zbMATH Keywords

rectilinear drawings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

On the rectilinear crossing number of complete uniform hypergraphs ⋮ Approximating the Rectilinear Crossing Number ⋮ An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants ⋮ On the 2-colored crossing number ⋮ Counting the number of crossings in geometric graphs ⋮ New algorithms and bounds for halving pseudolines ⋮ Unnamed Item ⋮ Approximating the rectilinear crossing number

This page was built for publication: Computational search of small point sets with small rectilinear crossing number