Sign in

General Lower Bounds for the Minor Crossing Number of Graphs.

Drago BokalÉva CzabarkaLászló A. SzékelyImrich 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