Login / Signup

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.

Patrizio AngeliniCarla BinucciGiordano Da LozzoWalter DidimoLuca GrilliFabrizio MontecchianiMaurizio PatrignaniIoannis G. Tollis
Published in: Comput. Geom. (2015)
Keyphrases
  • planar graphs
  • learning algorithm
  • computational complexity
  • lower bound
  • upper bound
  • worst case
  • optimization problems
  • approximation algorithms
  • upper and lower bounds