An efficient algorithm to find a double-loop network that realizes a given L-shape (Q2503285): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:54, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm to find a double-loop network that realizes a given L-shape |
scientific article |
Statements
An efficient algorithm to find a double-loop network that realizes a given L-shape (English)
0 references
14 September 2006
0 references
local area network
0 references
double-loop network
0 references
diameter
0 references
L-shape
0 references
algorithm
0 references
