Cuts, matrix completions and graph rigidity
- 1 October 1997
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 79 (1) , 255-283
- https://doi.org/10.1007/bf02614320
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- The Euclidean distance completion problem: cycle completabilityLinear and Multilinear Algebra, 1995
- Matroids and Rigid StructuresPublished by Cambridge University Press (CUP) ,1992
- Protein Structure Determination in Solution by Nuclear Magnetic Resonance SpectroscopyScience, 1989
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- When is a bipartite graph a rigid framework?Pacific Journal of Mathematics, 1980
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961
- Über eine Punktverteilung auf der KugelActa Mathematica Hungarica, 1959
- Metric spaces and positive definite functionsTransactions of the American Mathematical Society, 1938
- Remarks to Maurice Frechet's Article ``Sur La Definition Axiomatique D'Une Classe D'Espace Distances Vectoriellement Applicable Sur L'Espace De HilbertAnnals of Mathematics, 1935