Improved approximations of crossings in graph drawings

DOI10.1145/335305.335340zbMath1296.68109OpenAlexW2170147332MaRDI QIDQ3191996

Sudipto Guha, Guy Even, Baruch Schieber

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

A successful concept for measuring non-planarity of graphs: The crossing number., Vertex insertion approximates the crossing number of apex graphs