A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new graph parameter related to bounded rank positive semidefinite matrix completions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new graph parameter related to bounded rank positive semidefinite matrix completions |
scientific article |
Statements
A new graph parameter related to bounded rank positive semidefinite matrix completions (English)
0 references
27 June 2014
0 references
semidefinite programming
0 references
matrix completion
0 references
graph realizability
0 references
geometric graph representation
0 references
Euclidean distance matrix
0 references
graph minor
0 references
combinatorial matrix theory
0 references
0 references
0 references
0 references
0 references
0.8934175968170166
0 references
0.7951906323432922
0 references
0.7804381847381592
0 references
0.7610189318656921
0 references
0.7608243823051453
0 references
