An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength (Q5084683)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7549441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength |
scientific article; zbMATH DE number 7549441 |
Statements
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength (English)
0 references
28 June 2022
0 references
0 references
0 references
0.8041573762893677
0 references
0.7927189469337463
0 references
0.7923595309257507
0 references
0.7834777235984802
0 references
0.7804512977600098
0 references
