Login / Signup
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.
Patrizio Angelini
Carla Binucci
Giordano Da Lozzo
Walter Didimo
Luca Grilli
Fabrizio Montecchiani
Maurizio Patrignani
Ioannis 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