Embedding complete \(k\)-ary trees into \(k\)-square 2-D meshes with optimal edge congestion (Q1575316)
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 complete \(k\)-ary trees into \(k\)-square 2-D meshes with optimal edge congestion |
scientific article; zbMATH DE number 1493236
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding complete \(k\)-ary trees into \(k\)-square 2-D meshes with optimal edge congestion |
scientific article; zbMATH DE number 1493236 |
Statements
Embedding complete \(k\)-ary trees into \(k\)-square 2-D meshes with optimal edge congestion (English)
0 references
21 August 2000
0 references
embedding problem
0 references
expansion
0 references
load
0 references
edge congestion
0 references
2-D mesh
0 references
complete tree
0 references
divide \& conquer computation
0 references
