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, Princeton, New Jersey, USA , pp. 131-142 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_364).
Full text not available from this repository.
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.
Repository Staff Only: item control page