The maximum degree and diameter-bounded subgraph in the mesh (Q444444)
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: The maximum degree and diameter-bounded subgraph in the mesh |
scientific article; zbMATH DE number 6065740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum degree and diameter-bounded subgraph in the mesh |
scientific article; zbMATH DE number 6065740 |
Statements
The maximum degree and diameter-bounded subgraph in the mesh (English)
0 references
14 August 2012
0 references
network design
0 references
degree
0 references
diameter problem
0 references
parallel architectures
0 references
mesh
0 references
Delannoy numbers
0 references
0.905692994594574
0 references
0.838718593120575
0 references
0.7987263202667236
0 references
0.7895064949989319
0 references
0.7838528156280518
0 references
