Abstract

. The graph realization problem is that of computing the relative locations of a set of vertices placed in Euclidean space, relying only upon some set of inter-vertex distance measurements. This paper is concerned with the closely related problem of determining whether or not a graph has a unique realization. Both these problems are NP-hard, but the proofs rely upon special combinations of edge lengths. If we assume the vertex locations are unrelated then the uniqueness question can be approached from a purely graph theoretic angle that ignores edge lengths. This paper identifies three necessary graph theoretic conditions for a graph to have a unique realization in any dimension. Efficient sequential and NC algorithms are presented for each condition, although these algorithms have very different flavors in different dimensions. 1. Introduction. Consider a graph G = (V; E) consisting of a set of n vertices and m edges, along with a real number associated with each edge. Now try to assi...

Citations

2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
53	The rigidity of graphs - ASIMOW, ROTH - 1979
51	Almost all simply connected closed surfaces are rigid - Gluck - 1974
44	Solution of Sparse Linear Least Squares Problems Using Givens Rotations - George, Heath - 1980
34	Predicting structure in sparse matrix computations - Gilbert - 1994
33	Generic global rigidity - CONNELLY - 2005
21	Predicting fill for sparse orthogonal factorization - COLEMAN, EDENBRANDT, et al. - 1986
17	When is a bipartite graph a rigid framework - Bolker, Roth - 1980
12	Forests, frames and games: Algorithms for matroid sums and applications - Gabow, Westermann - 1988
9	Structural rigidity - Crapo - 1979
9	The generic rigidity of minimal cycles - Fogelsanger - 1988
8	A probabilistic algorithm for vertex connectivity of graphs - Becker, Degenhardt, et al. - 1982
3	Deuxieme memoire sur les polygons et les polyedres, J. Ecole POlytechnique XVIe Cahier - Cauchy
3	The null space problem II - Coleman, Pothen - 1987
2	On determining vertex connectivity - Cheriyan, Thurimella - 1990