This survey concentrates on selected theoretical and computational aspects of the crossing number of graphs. Starting with its introduction by Turán, we will discuss known results for complete and complete bipartite graphs. Then we will focus on some historical confusion on the crossing number that has been brought up by Pach and Tóth as well as Székely. A connection to computational geometry is made in the section on the geometric version, namely the rectilinear crossing number. We will also mention some applications of the crossing number to geometrical problems. This review ends with recent results on approximation and exact computations. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Mutzel, P. (2009). The crossing number of graphs: Theory and computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5760 LNCS, pp. 305–317). https://doi.org/10.1007/978-3-642-03456-5_21
Mendeley helps you to discover research relevant for your work.