Sign in

Extending Nearly Complete 1-Planar Drawings in Polynomial Time.

Eduard EibenRobert GanianThekla HammFabian KluteMartin Nöllenburg
Published in: MFCS (2020)
Keyphrases
  • line drawings
  • computational complexity
  • special case
  • approximation algorithms
  • artificial intelligence
  • databases
  • single point
  • planar graphs
  • data sets
  • real world
  • decision trees
  • viewpoint
  • np hard