OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809)
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: OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks |
scientific article; zbMATH DE number 6579247
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks |
scientific article; zbMATH DE number 6579247 |
Statements
OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (English)
0 references
11 May 2016
0 references
disjoint paths
0 references
minimum total length
0 references
sensor networks
0 references
distributed algorithm
0 references
0 references
0 references
0.85164464
0 references
0.8459579
0 references
0.8419218
0 references
