Finding shortest paths in distributed loop networks (Q293346)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding shortest paths in distributed loop networks |
scientific article; zbMATH DE number 6590743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding shortest paths in distributed loop networks |
scientific article; zbMATH DE number 6590743 |
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
0.8269683122634888
0 references
0.7628493309020996
0 references
0.7514810562133789
0 references
