Login / Signup

On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.

Daniel BienstockClyde L. Monma
Published in: Algorithmica (1990)
Keyphrases
  • distance measure
  • planar graphs
  • vector space
  • euclidean distance
  • distance function
  • similarity measure
  • dynamic time warping
  • worst case
  • decision trees
  • computational complexity