General Lower Bounds for the Minor Crossing Number of Graphs.

Drago Bokal Éva Czabarka László A. Székely Imrich Vrt'o

Published in: Discret. Comput. Geom. (2010)

Keyphrases

lower bound
special case
small number
upper bound
computational complexity
np hard
worst case
directed graph
graph matching
random graphs
concept class