Embeddability of weighted graphs in k-space is strongly NP-Hard

  • Saxe J
  • 34


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


In this paper we investigate the complexity of embedding edge-weighted graphs into Euclidean spaces: Given an (incomplete) edge-weighted graph, G, can the vertices of G be mapped to points in Euclidean k-space in such a way that any two vertices connected by an edge are mapped to points whose distance is equal to the weight of the edge? We prove that the preceding problem is NP-Hard (by reduction from 3-Satisfiability), even when k=1 and the edge weights are restricted to take on the values 1 and 2. Related results are shown for the problem of testing the uniqueness of a known embedding and for variations involving inexact edge weights.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links


  • James Saxe

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free