Cuts, matrix completions and graph rigidity (Q1365058)

From MaRDI portal
Revision as of 18:29, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Cuts, matrix completions and graph rigidity
scientific article

    Statements

    title
    Cuts, matrix completions and graph rigidity (English)
    0 references
    DOI
    10.1007/BF02614320
    0 references
    author
    Monique Laurent
    0 references
    publication date
    25 May 1998
    0 references
    zbMATH DE Number
    1053961
    0 references
    zbMATH Keywords
    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
    cites work
    On the cut polytope
    0 references
    Q5461825
    0 references
    Q3487569
    0 references
    Q4382664
    0 references
    Q4749029
    0 references
    Q4840774
    0 references
    Q4012027
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1365058&oldid=34187362"
    Powered by MediaWiki