Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength (Q6492014)
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: Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength |
scientific article; zbMATH DE number 7837626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength |
scientific article; zbMATH DE number 7837626 |
Statements
Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength (English)
0 references
24 April 2024
0 references
graph embedding
0 references
wirelength
0 references
hierarchical cubic networks
0 references
\(k\)-rooted complete binary trees
0 references
0 references
0 references
0 references
0 references
