On the complexity of some arborescences finding problems on a multishop radio network (Q1123615)
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 complexity of some arborescences finding problems on a multishop radio network |
scientific article; zbMATH DE number 4110108
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of some arborescences finding problems on a multishop radio network |
scientific article; zbMATH DE number 4110108 |
Statements
On the complexity of some arborescences finding problems on a multishop radio network (English)
0 references
1989
0 references
minimum spanning trees
0 references
NP-completeness
0 references
radio networks
0 references
arborescences
0 references
