Towards better approximation of graph crossing number

DOI10.1109/FOCS46700.2020.00016MaRDI QIDQ6944041zbMATH OpenFDO

Authors Zihan Tan, Sepideh Mahabadi, Julia Chuzhoy

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00016

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(2)

• Approximating the crossing number of dense graphs (poster abstract)
• An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers

This page was built for publication: Towards better approximation of graph crossing number

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