Conditions for Unique Graph Realizations
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (1) , 65-84
- https://doi.org/10.1137/0221008
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- On generic global rigidityPublished by American Mathematical Society (AMS) ,1991
- The Null Space Problem II. AlgorithmsSIAM Journal on Algebraic Discrete Methods, 1987
- Predicting fill for sparse orthogonal factorizationJournal of the ACM, 1986
- A probabilistic algorithm for vertex connectivity of graphsInformation Processing Letters, 1982
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- When is a bipartite graph a rigid framework?Pacific Journal of Mathematics, 1980
- The rigidity of graphs, IIJournal of Mathematical Analysis and Applications, 1979
- The rigidity of graphsTransactions of the American Mathematical Society, 1978
- Almost all simply connected closed surfaces are rigidPublished by Springer Nature ,1975
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973