On the crossing number of complete graphs

DOI10.1145/513400.513403zbMath1414.68037OpenAlexW2030475740MaRDI QIDQ4557532

Hannes Krasser, Oswin Aichholzer, Franz Aurenhammer

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/513400.513403

zbMATH Keywords

rectilinear crossing numbercomplete graphorder type

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Subquadratic Encodings for Point Configurations