Cost Trade-offs in Graph Embeddings, with Applications (Q3763589)
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: Cost Trade-offs in Graph Embeddings, with Applications |
scientific article; zbMATH DE number 4020475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cost Trade-offs in Graph Embeddings, with Applications |
scientific article; zbMATH DE number 4020475 |
Statements
Cost Trade-offs in Graph Embeddings, with Applications (English)
0 references
1983
0 references
alternation
0 references
nondeterminism
0 references
graph embeddings
0 references
dilation-cost
0 references
expansion- cost
0 references
cost trade-offs
0 references
generic graphs
0 references
0.8947699666023254
0 references
0.8947422504425049
0 references
0.8204140067100525
0 references
0.8136349320411682
0 references
