Login / Signup

The Complexity of Several Realizability Problems for Abstract Topological Graphs.

Jan Kyncl
Published in: Graph Drawing (2007)
Keyphrases
  • polynomial time complexity
  • decision problems
  • np hardness
  • data sets
  • learning algorithm
  • computational complexity
  • evolutionary algorithm
  • np complete