Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: A Survey

Shahrokhi, Farhad and Székely, László A. and Vrt'o, Imrich (1995) Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: A Survey. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 131-142(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_364).

Full text not available from this repository.

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 results or those results which have an algorithmic flavor, including the recent results of the outhors.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-58950-3_364
Classifications: Z Theory > Z.001 General
G Algorithms and Complexity > G.420 Crossings
A General Literature > A.001 Introductory and Survey
URI: http://gdea.informatik.uni-koeln.de/id/eprint/129

Actions (login required)

View Item View Item