Cuts, matrix completions and graph rigidity (Q1365058)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Cuts, matrix completions and graph rigidity
scientific article

    Statements

    Cuts, matrix completions and graph rigidity (English)
    0 references
    0 references
    0 references
    25 May 1998
    0 references
    0 references
    polyhedral combinatorics
    0 references
    cut
    0 references
    semidefinite programming
    0 references
    Euclidean distance matrices
    0 references
    matrix completion
    0 references
    graph realization problem
    0 references
    graph rigidity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references