Graphs on alphabets as models for large interconnection networks (Q1199426): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)90135-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072271413 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs on alphabets as models for large interconnection networks |
scientific article |
Statements
Graphs on alphabets as models for large interconnection networks (English)
0 references
16 January 1993
0 references
bisequence graph
0 references
Kautz graph
0 references
de Bruijn graph
0 references
Moore bound
0 references
graphs on alphabets
0 references
labelling
0 references
words
0 references
large interconnection networks
0 references
efficient routing algorithms
0 references
diameter
0 references
maximum degree
0 references
0 references
