Constructing Uniquely Realizable Graphs

  title={Constructing Uniquely Realizable Graphs},
  author={Igor Pak and Dan Vilenchik},
  journal={Discrete & Computational Geometry},
In the Graph Realization Problem (GRP), one is given a graph G, a set of non-negative edge-weights, and an integer d. The goal is to find, if possible, a realization of G in the Euclidian space R, such that the distance between any two vertices is the assigned edge weight. The problem has many applications in mathematics and computer science, but is NP-hard when the dimension d is fixed. Characterizing tractable instances of GRP is a classical problem, first studied by Menger in 1931. We… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 38 references

Rigidity and Energy

View 12 Excerpts
Highly Influenced

Embeddability of Weighted Graphs in k-Space is Strongly NP- Hard

J. B. Saxe
Proc. 17-th Allerton Conf. Comm. Control Comp. • 1979
View 5 Excerpts
Highly Influenced

A Semidefinite Programming Approach to the Graph Realization Problem

A. So
Ph.D. thesis, Stanford • 2007
View 3 Excerpts
Highly Influenced

Circular chromatic number: a survey

Discrete Mathematics • 2001
View 3 Excerpts
Highly Influenced


R. Connelly
Handbook of convex geometry, vol. A, 223-271, North-Holland, Amsterdam • 1993
View 4 Excerpts
Highly Influenced

A New Foundation of Non-Euclidean, Affine, Real Projective and Euclidean Geometry.

Proceedings of the National Academy of Sciences of the United States of America • 1938
View 3 Excerpts
Highly Influenced

Eigenvalue bounds for independent sets

J. Comb. Theory, Ser. B • 2008
View 1 Excerpt

A Theory of Network Localization

IEEE Transactions on Mobile Computing • 2006
View 2 Excerpts

Similar Papers

Loading similar papers…