On the maximum crossing number

DOI10.1007/978-3-319-78825-8_6MaRDI QIDQ1642684zbMATH OpenOpenAlexFDO

Authors Markus Chimani, Stefan Felsner, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff, Stephen G. Kobourov

Publication date 15 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78825-8_6

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• On the Maximum Crossing Number
• Approximating the maximum rectilinear crossing number
• Some provably hard crossing number problems
• Bounds for Convex Crossing Numbers
• Which crossing number is it anyway?

Cited in

(8)

• On the number of maximum intervals
• Many touchings force many crossings
• Weighted Turán problems with applications
• Approximating the maximum rectilinear crossing number
• The Bundled Crossing Number
• scientific article; zbMATH DE number 1953110 (Why is no real title available?)
• On the Maximum Crossing Number
• scientific article; zbMATH DE number 2145245 (Why is no real title available?)

This page was built for publication: On the maximum crossing number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1642684)