Skip to main content
Conference Proceedings

Crossing numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1763 267-273
DOI: 10.1007/978-3-540-46515-7_23
7Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The crossing number of a graph G is the minimum number of crossings in a drawing of G. The determination of the crossing number is an NP-complete problem. We present two general lower bounds for the crossing number, and survey their applications and generalizations.

Cite

CITATION STYLE

APA

Pach, J. (2000). Crossing numbers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1763, pp. 267–273). Springer Verlag. https://doi.org/10.1007/978-3-540-46515-7_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free