An efficient algorithm to find a double-loop network that realizes a given L-shape (Q2503285)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5054282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to find a double-loop network that realizes a given L-shape |
scientific article; zbMATH DE number 5054282 |
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
0.8906974792480469
0 references
0.8389366865158081
0 references
0.8371381759643555
0 references
0.8369171023368835
0 references
0.823146641254425
0 references
