An efficient algorithm to find a double-loop network that realizes a given L-shape (Q2503285): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.048 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988529785 / rank | |||
Normal rank | |||
Revision as of 23:38, 19 March 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
