Abstract. Given an undirected graph G = (V; E) with node set V = [1; n], a subset S ` V and a rational vector a 2 Q S[E, the positive semidefinite matrix completion problem consists of determining whether there exists a real symmetric n \Theta n positive semidefinite matrix X = (x ij) satisfying: x ii = a i (i 2 S) and x ij = a ij (ij 2 E). Similarly, the Euclidean distance matrix completion problem asks for the existence of a Euclidean distance matrix completing a partially defined given matrix. It is not known whether these problems belong to NP. We show here that they can be solved in polynomial time when restricted to the graphs having a fixed minimum fill-in; the minimum fill-in of graph G being the minimum number of edges needed to be added to G in order to obtain a chordal graph. A simple combinatorial algorithm permits to construct a completion in polynomial time in the chordal case. We also show that the completion problem is polynomially solvable for a class of graphs including wheels of fixed length (assuming all diagonal entries are specified). The running time of our algorithms is polynomially bounded in terms of n and the bitlength of the input a. We also observe that the matrix completion problem can be solved in polynomial time in the real number model for the class of graphs containing no homeomorph of K 4.
|
7715
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
972
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
866
|
Algorithmic graph theory and perfect graphs
– Golumbic
- 1980
|
|
457
|
A new polynomial-time algorithm for linear programming
– Karmarkar
- 1984
|
|
422
|
Semidefinite Programming
– Vandenberghe, Boyd
- 1996
|
|
405
|
Interior point methods in semidefinite programming with applications to combinatorial optimization
– Alizadeh
- 1995
|
|
303
|
On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
– Blum, Shub, et al.
- 1989
|
|
259
|
A polynomial algorithm in linear programming
– Khachiyan
- 1979
|
|
259
|
Primal-Dual Interior-Point Methods
– WRIGHT
- 1997
|
|
245
|
Algorithmic Aspects of Vertex Elimination on Graphs
– Rose, Tarjan, et al.
- 1976
|
|
195
|
Interior-point polynomial algorithms in convex programming
– Nesterov, Nemirovskii
- 1994
|
|
177
|
An interior-point method for semidefinite programming
– HELMBERG, RENDL, et al.
- 1996
|
|
137
|
Integer programming with a fixed number of variables
– Lenstra
- 1983
|
|
131
|
Computing the minimum fill-in is NP-complete
– Yannakakis
- 1981
|
|
102
|
Distance Geometry and Molecular Conformation
– CRIPPEN, HAVEL
- 1988
|
|
74
|
On the cut polytope
– Barahona, Mahjoub
- 1986
|
|
61
|
Decomposition by clique separators
– Tarjan
- 1985
|
|
35
|
An exact duality theory for semidefinite programming and its complexity implications, in: Semidefinite programming
– Ramana
- 1997
|
|
33
|
Solving Euclidean distance matrix completion problems via semidefinite programming
– ALFAKIH, KHANDANI, et al.
- 1999
|
|
33
|
The molecule problem: exploiting structure in global optimization
– HENDRICKSON
- 1995
|
|
32
|
Geometric Algorithms and Combinatorial Optimization
– otschel, asz, et al.
- 1988
|
|
31
|
Positive definite completions of partial Hermitian matrices. Linear Algebra Appl
– GRONE, JOHNSON, et al.
- 1984
|
|
26
|
Constrained multidimensional scaling
– Heiser, Meulman
- 1983
|
|
20
|
Matrix completion problems: a survey
– JOHNSON
- 1989
|
|
19
|
Feasability Testing for Systems of Real Quadratic Equations
– Barvinok
- 1993
|
|
19
|
An interiorpoint method for approximate positive semidefinite completions
– JOHNSON, KROSCHEL, et al.
- 1998
|
|
16
|
Extensions of band matrices with band inverses
– Dym, Gohberg
- 1981
|
|
13
|
Distance geometry optimization for protein structures
– E, WU
- 1999
|
|
12
|
The Euclidean distance matrix completion problem
– BAKONYI, JOHNSON
- 1995
|
|
11
|
On the complexity of semidefinite programs
– Porkolab, Khachiyan
- 1997
|
|
9
|
Connections between the real positive semidefinite and distance matrix completion problems
– JOHNSON, TARAZAGA
- 1995
|
|
9
|
Steiner trees, partial 2-trees, and minimum IFI networks
– Wald, Colbourn
- 1983
|
|
7
|
The real positive definite completion problem: cycle completability
– BARRETT, JOHNSON, et al.
- 1993
|
|
7
|
matrix completions and graph rigidity
– Cuts
- 1997
|
|
7
|
A connection between positive semidefinite and Euclidean distance matrix completion problems
– LAURENT
- 1998
|
|
6
|
On the matrix completion method for multidimensional moment problems
– Bakonyi, Naevdal
- 1998
|
|
5
|
The real positive semidefinite completion problem for series-parallel graphs. Linear Algebra and its Applications
– Laurent
- 1997
|
|
4
|
Positive semidefinite matrices with a given sparsity pattern. Linear Algebra and its Applications
– Agler, Helton, et al.
- 1988
|
|
3
|
Computing integral points in convex semi-algebraic sets
– Khachiyan, Porkolab
- 1997
|
|
2
|
On the order of a graph and its deficiency in chordality
– Laurent
- 1998
|
|
1
|
Remarks to M. Fr'echet's article "Sur la d'efinition axiomatique d'une classe d'espaces vectoriels distanci'es applicables vectoriellement sur l'espace de Hilbert
– Schoenberg
- 1935
|
|
