Finding shortest paths in distributed loop networks (Q293346): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reliable circulant networks with minimum transmission delay / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fault-tolerant routing in distributed loop networks / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:38, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding shortest paths in distributed loop networks |
scientific article |
Statements
Finding shortest paths in distributed loop networks (English)
0 references
9 June 2016
0 references
distributed systems
0 references
loop networks
0 references
shortest path
0 references
modular arithmetic
0 references
