Graph cores via universal completability (Q322258)
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: Graph cores via universal completability |
scientific article; zbMATH DE number 6639389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph cores via universal completability |
scientific article; zbMATH DE number 6639389 |
Statements
Graph cores via universal completability (English)
0 references
14 October 2016
0 references
universal rigidity
0 references
universal completability
0 references
graph cores
0 references
0 references
0 references
0 references
0.89202416
0 references
0.8910908
0 references
0.88964075
0 references
0.8860279
0 references
0 references
0.8792434
0 references
0.8775721
0 references
0 references
