On the sparsity order of a graph and its deficiency in chordality

Combinatorica

Volumn 21, Issue 4, 2001, Pages 543-570

  Laurent, Monique ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040489291     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930100012     Document Type: Article

References (19)

1. J. AGLER, J. W. HELTON, S. MCCULLOUGH, and L. RODMAN: Positive semidefinite matrices with a given sparsity pattern, Linear Algebra and its Applications, 107 (1988), 101-149.
2. M. DEZA and M. LAURENT: Geometry of Cuts and Metrics. Vol. 15 of Algorithms and Combinatorics, Springer-Verlag, Berlin, 1997.
3. G. A. DIRAC: On rigid circuit graphs, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 25 (1961), 71-76.
4. 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.
5. R. GRONE and S. PIERCE: Extremal bipartite matrices, Linear Algebra and its Applications, 131 (1990), 39-50.
6. J. W. HELTON, D. LAM, and H. J. WOEDERMAN: Sparsity patterns with high rank extremal positive semidefinite matrices, SIAM Journal on Matrix Analysis and its Applications, 15 (1994), 299-312.
7. J. W. HELTON, S. PIERCE, and L. RODMAN: The ranks of extremal positive semidefinite matrices with given sparsity pattern, SIAM Journal on Matrix Analysis and its Applications, 10 (1989), 407-423.
8. R. D. HILL and S. R. WATERS: On the cone of positive semidefmite matrices, Linear Algebra and its Applications, 90 (1987), 81-88.
9. C. R. JOHNSON: Matrix completion problems: a survey, in: C. R. Johnson, editor, Matrix Theory and Applications, volume 40 of Proceedings of Symposia in Applied Mathematics, pages 171-198. American Mathematical Society, Providence, Rhode Island, 1990.
10. M. LAURENT: Cuts, matrix completions and graph rigidity, Mathematical Programming, 79 (1997), 255-283.
11. M. LAURENT: Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems, SIAM Journal on Matrix Analysis and its Applications, 22 (2000), 874-894. (Electronic publication.)
12. S. MCCULLOUGH: 2-chordal graphs, in: I. Gohberg, J. W. Helton and L. Rodman, eds., Contributions to Operator Theory and its Applications, Vol. 35 in Series Operator Theory: Advances and Applications, pages 143-192, Birkhäuser-Verlag, Basel, 1988.
13. S. MCCULLOUGH: Minimal separators of 2-chordal graphs, Linear Algebra and its Applications, 184 (1993), 187-199.
14. V. I. PAULSEN, S. C. POWER, and R. R. SMITH: Schur products and matrix completions, Journal of Functional Analysis, 85 (1989), 151-178.
15. D. J. ROSE: Triangulated graphs and the elimination process, Journal of Mathematical Analysis and Applications, 32 (1970), 597-609.
16. A. SCHRIJVER: A Course on Combinatorial Optimization. Lecture Notes, 1994.
17. N. SHAKED-MONDERER: Extremal positive semidefinite matrices with given sparsity pattern. Linear and Multilinear Algebra, 36 (1994), 287-292.
18. R. E. TARJAN: Decomposition by clique separators, Discrete Mathematics, 55 (1985), 221-232.
19. M. YANNAKAKIS: Computing the minimum fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods, 2 (1981), 77-79.