Conference ProceedingsOPEN ACCESS

Crossing numbers of graphs, lower bound techniques and algorithms: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 894 131-142
DOI: 10.1007/3-540-58950-3_364
15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We give a survey of recent techniques for deriving lower bounds and algorithms for constructing upper bounds for several variations of the crossing number problem. Our aim is to emphasize the more general resuits or those results which have an algorithmic flavor, including the recent results of the authors.

Cite

CITATION STYLE

APA

Shahrokhi, F., Székely, L. A., & Vrt’o, I. (1995). Crossing numbers of graphs, lower bound techniques and algorithms: A survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 894, pp. 131–142). Springer Verlag. https://doi.org/10.1007/3-540-58950-3_364

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