Skip to main content
SpringerLink
Log in

Cuts, matrix completions and graph rigidity

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper brings together several topics arising in distinct areas: polyhedral combinatorics, in particular, cut and metric polyhedra; matrix theory and semidefinite programming, in particular, completion problems for positive semidefinite matrices and Euclidean distance matrices; distance geometry and structural topology, in particular, graph realization and rigidity problems.

Cuts and metrics provide the unifying theme. Indeed, cuts can be encoded as positive semidefinite matrices (this fact underlies the approximative algorithm for max-cut of Goemans and Williamson) and both positive semidefinite and Euclidean distance matrices yield points of the cut polytope or cone, after applying the functions 1/π arccos(.) or √. When fixing the dimension in the Euclidean distance matrix completion problem, we find the graph realization problem and the related question of unicity of realization, which leads to the question of graph rigidity.

Our main objective here is to present in a unified setting a number of results and questions concerning matrix completion, graph realization and rigidity problems. These problems contain indeed very interesting questions relevant to mathematical programming and we believe that research in this area could yield to cross-fertilization between the various fields involved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Alizadeh, Interior point methods in semidefinite programming with applications in combinatorial optimization,SIAM Journal on Optimization 5 (1995) 13–51.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Bakonyi and C.R. Johnson, The Euclidian distance matrix completion problem,SIAM Journal on Matrix Analysis and Applications 16 (1995) 646–654.

    Article  MATH  MathSciNet  Google Scholar 

  3. F. Barahona, On cuts and matchings in planar graphs,Mathematical Programming 60 (1993) 53–68.

    Article  MathSciNet  Google Scholar 

  4. F. Barahona and A.R. Mahjoub, On the cut polytope,Mathematical Programming 36 (1986) 157–173.

    Article  MATH  MathSciNet  Google Scholar 

  5. W.W. Barrett, C.R. Johnson and R. Loewy, The real positive definite completion problem: Cycle completability,Memoirs of the American Mathematical Society 584 (1996) 69 pp.

    Google Scholar 

  6. W. Barrett, C.R. Johnson and P. Tarazaga, The real positive definite completion problem for a simple cycle,Linear Algebra and its Applications 192 (1993) 3–31.

    Article  MATH  MathSciNet  Google Scholar 

  7. A.I. Barvinok, Problems of distance geometry and convex properties of quadratic maps,Discrete and Computational Geometry 13 (1995) 189–202.

    Article  MATH  MathSciNet  Google Scholar 

  8. L.M. Blumenthal,Theory and Applications of Distance Geometry (Oxford University Press, Oxford, 1953; Chelsea, New York, 2nd ed., 1970).

    MATH  Google Scholar 

  9. E.D. Bolker and B. Roth, When is a bipartite graph a rigid framework?Pacific Journal of Mathematics 90 (1980) 27–44.

    MATH  MathSciNet  Google Scholar 

  10. J.P.R. Christensen and J. Vesterstrøm, A note on extreme positive definite matrices,Mathematische Annalen 244 (1979) 65–68.

    Article  MATH  MathSciNet  Google Scholar 

  11. G.M. Crippen and T.F. Havel,Distance Geometry and Molecular Conformation (Research Studies Press, Taunton, Somerset, UK, 1988).

    MATH  Google Scholar 

  12. M. Deza and M. Laurent,Geometry of Cuts and Metrics, Algorithms and Combinatorics, Vol. 15 (Springer, Berlin, 1997).

    MATH  Google Scholar 

  13. G.A. Dirac, On rigid circuit graphs,Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 25 (1961) 71–76.

    MATH  MathSciNet  Google Scholar 

  14. R. Duffin, Topology of series-parallel networks,Journal of Mathematical Analysis and Applications 10 (1965) 303–318.

    Article  MATH  MathSciNet  Google Scholar 

  15. J. Edmonds, Minimum partition of a matroid into independent subsets,Journal of Research of the National Bureau of Standards B 69 (1965) 67–72.

    MATH  MathSciNet  Google Scholar 

  16. L. Fejes Tóth, Über eine Punktverteilung auf der Kugel,Acta Mathematica Academiae Scientiarum Hungaricae 10 (1959) 13–19.

    Article  MathSciNet  Google Scholar 

  17. H.N. Gabow and H.H. Westermann, Forests, frames and games: Algorithms for matroid sums and applications, in:Proc. 20th Ann. ACM Symp. on the Theory of Computing (1988) 407–421.

  18. M.X. Goemans and D.P. Williamson, 0.878-approximation algorithms for MAX CUT and MAX 2SAT, in:Proc. 26th Ann. ACM Symp. on the Theory of Computing (1994) 422–431.

  19. R. Grone, C.R. Johnson, E.M. Sá and H. Wolkowicz, Positive definite completions of partial hermitian matrices,Linear Algebra and its Applications 58 (1984) 109–124.

    Article  MATH  MathSciNet  Google Scholar 

  20. R. Grone, S. Pierce and W. Watkins, Extremal correlation matrices,Linear Algebra and its Applications 134 (1990) 63–70.

    Article  MATH  MathSciNet  Google Scholar 

  21. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization,Combinatorica 1 (1981) 169–197.

    Article  MATH  MathSciNet  Google Scholar 

  22. M. Grötschel, L. Lovász and A. Schrijver,Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, Vol. 2 (Springer, Berlin, 1988).

    MATH  Google Scholar 

  23. B. Hendrickson, The molecule problem: Determining conformation from pairwise distances, Ph.D. Thesis, Tech. Rept. 90–1159, Dept. of Computer Science, Cornell University, Ithaca, NY, 1990.

    Google Scholar 

  24. B. Hendrickson, Conditions for unique graph realizations,SIAM Journal on Computing 21 (1992) 65–84.

    Article  MATH  MathSciNet  Google Scholar 

  25. B. Hendrickson, The molecule problem: Exploiting structure in global optimization,SIAM Journal on Optimization 5 (1995) 835–857.

    Article  MATH  MathSciNet  Google Scholar 

  26. C.R. Johnson, Matrix completion problems: a survey, in: C.R. Johnson, ed.,Matrix Theory and Applications, Proceedings of Symposia in Applied Mathematics, Vol. 40 (American Mathematical Society, Providence, RI, 1990) 171–198.

    Google Scholar 

  27. C.R. Johnson, C. Jones and B. Kroschel, The distance matrix completion problem: Cycle completability,Linear and Multilinear Algebra 39 (1995) 195–207.

    MATH  MathSciNet  Google Scholar 

  28. C.R. Johnson, B. Kroschel and H. Wolkowicz, An interior-point method for approximate positive semidefinite completions, CORR Rept. 95-11, University of Waterloo, 1995, to appear inComputational Optimization and Applications.

  29. C.R. Johnson and T.A. McKee, Structural conditions for cycle completable graphs,Discrete Mathematics 159 (1996) 155–160.

    Article  MATH  MathSciNet  Google Scholar 

  30. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds.,Complexity of Computer Computations (Plenum Press, New York, 1972) 85–103.

    Google Scholar 

  31. G. Laman, On graphs and rigidity of plane skeletal structures,Journal of Engineering Mathematics 4 (1970) 331–340.

    Article  MATH  MathSciNet  Google Scholar 

  32. M. Laurent, The real positive semidefinite completion problem for series-parallel graphs,Linear Algebra and its Applications 252 (1997) 347–366.

    Article  MATH  MathSciNet  Google Scholar 

  33. M. Laurent, A connection between positive semidefinite and Euclidean distance matrix completion problems,Linear Algebra and its Applications (1997), to appear.

  34. M. Laurent, A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems, in: P. Pardalos and H. Wolkowicz, eds.,Topics in Semidefinite and Interior-Point Methods, The Fields Institute for Research in Mathematical Science, Communications Series, Providence, RI (1997), to appear.

    Google Scholar 

  35. M. Laurent, Max-cut problem, in: M. Dell’Amico, F. Maffioli and S. Martello, eds.,Annotated Bibliographies in Combinatorial Optimization (John Wiley & Sons, New York, 1997), to appear.

    Google Scholar 

  36. M. Laurent and S. Poljak, On a positive semidefinite relaxation of the cut polytope,Linear Algebra and its Applications 223–224 (1995) 439–461.

    Article  MathSciNet  Google Scholar 

  37. J. de Leeuw and W. Heiser, Theory of multidimensional scaling, in: P.R. Krishnaiah and L.N. Kanal, eds,Handbook of Statistics, Vol. 2 (North-Holland, Amsterdam, 1982) 285–316.

    Google Scholar 

  38. Chi-Kwong Li and Bit-Shun Tam, A note on extreme correlation matrices,SIAM Journal on Matrix Analysis and its Appplications 15 (1994) 903–908.

    Article  MATH  MathSciNet  Google Scholar 

  39. R. Loewy, Extreme points of a convex subset of the cone of positive semidefinite matrices,Mathematische Annalen 253 (1980) 227–232.

    MATH  MathSciNet  Google Scholar 

  40. L. Lovász and Y. Yemini, On generic rigidity in the plane,SIAM Journal on Algebraic and Discrete Methods 3 (1982) 91–98.

    Article  MATH  Google Scholar 

  41. Y.E. Nesterov and A.S. Nemirovsky,Interior Point Polynomial Algorithms in Convex Programming: Theory and Algorithms (SIAM Publications, Philadelphia, PA. 1994).

    MATH  Google Scholar 

  42. P.M. Pardalos and X. Lin, A tabu based pattern search method for the distance geometry problem, in: F. Giannessis et al., eds.,Mathematical Programming (Kluwer Academic Publishers, Dordrecht, 1997).

    Google Scholar 

  43. S. Poljak and Z. Tuza, Maximum cuts and largest bipartite subgraphs, in: W. Cook, L. Lovász and P.D. Seymour, eds.,Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 20 (AMS, Providence, RI, 1995) 181–244.

    Google Scholar 

  44. M.V. Ramana, An exact duality theory for semidefinite programming and its complexity implications,Mathematical Programming 77 (1997) 129–162.

    Article  MathSciNet  Google Scholar 

  45. B. Roth, Rigid and flexible frameworks,The American Mathematical Monthly 88 (1981) 6–21.

    Article  MATH  MathSciNet  Google Scholar 

  46. D.J. Rose, R.E. Tarjan and G.S. Lueker, Algorithmic aspects of vertex elimination on graphs,SIAM Journal on Computing 5 (1976) 266–283.

    Article  MATH  MathSciNet  Google Scholar 

  47. J.B. Saxe, Embeddability of weighted graphs ink-space is strongly NP-hard, in:Proc. 17th Allerton Conf. in Communications, Control and Computing (1979) 480–489.

  48. I.J. Schoenberg, Remarks to M. Fréchet’s article “Sur la définition axiomatique d’une classe d’espaces vectoriels distanciés applicables vectoriellement sur l’espace de Hilbert”,Annals of Mathematics 36 (1935) 724–732.

    Article  MathSciNet  Google Scholar 

  49. I.J. Schoenberg, Metric spaces and positive definite functions,Transactions of the American Mathematical Society 44 (1938) 522–536.

    Article  MATH  MathSciNet  Google Scholar 

  50. R.E. Tarjan, Decomposition by clique separators,Discrete mathematics 55 (1985) 221–232.

    Article  MATH  MathSciNet  Google Scholar 

  51. J.A. Wald and C.J. Colbourn, Steiner trees, partial 2-trees and minimum IFI networks,Networks 13 (1983) 159–167.

    MATH  MathSciNet  Google Scholar 

  52. W. Whiteley, Matroids and rigid structures, in: N. White, ed.,Matroid Applications, Encyclopedia of Mathematics and its Applications, Vol. 40 (Cambridge University Press, Cambridge, MA, 1992) 1–53.

    Google Scholar 

  53. K. Wüthrich, Protein structure determination in solution by nuclear magnetic resonance spectroscopy,Science 243 (1989) 45–50.

    Article  Google Scholar 

  54. Y. Yemini, Some theoretical aspects of position-location problems, in:Proc. 20th Ann. Symp. on Foundations of Computer Science (1979) 1–8.

Download references

Author information

Authors and Affiliations

  1. LIENS - Ecole Normale Supérieure, 45 rue d’Ulm, 75230, Paris Cedex 05, France

    Monique Laurent

  2. CWI, Krulslann 413, 1098 SJ, Amsterdam, The Netherlands

    Monique Laurent

Authors
  1. Monique Laurent
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Laurent, M. Cuts, matrix completions and graph rigidity. Mathematical Programming 79, 255–283 (1997). https://doi.org/10.1007/BF02614320

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02614320

Keywords

Search

Navigation