Extending Nearly Complete 1-Planar Drawings in Polynomial Time.

Eduard Eiben Robert Ganian Thekla Hamm Fabian Klute Martin Nöllenburg

Published in: CoRR (2020)

Keyphrases

line drawings
special case
computational complexity
computer vision
single point
planar graphs
neural network
machine learning
three dimensional
multiscale
relational databases
evolutionary algorithm
upper bound
worst case