On the computational complexity of continuous routing (Q4203819)
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: On the computational complexity of continuous routing |
scientific article; zbMATH DE number 4123299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of continuous routing |
scientific article; zbMATH DE number 4123299 |
Statements
On the computational complexity of continuous routing (English)
0 references
1989
0 references
continuous routing
0 references
network
0 references
distributed algorithms
0 references
NP-hardness
0 references
continuous broadcasting
0 references
0.9084434
0 references
0.8989496
0 references
0.8989496
0 references
0.89726466
0 references
0.89726466
0 references
0.8930471
0 references
0.88918096
0 references
0.88918096
0 references
0 references
