A polynomial-time algorithm for message routing in hierarchical communication networks (Q1129965)
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: A polynomial-time algorithm for message routing in hierarchical communication networks |
scientific article; zbMATH DE number 1191320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for message routing in hierarchical communication networks |
scientific article; zbMATH DE number 1191320 |
Statements
A polynomial-time algorithm for message routing in hierarchical communication networks (English)
0 references
5 November 1998
0 references
polynomial-time algorithm
0 references
hierarchical communication network
0 references
two-level network
0 references
spanning tree
0 references
0 references
0 references
0.7534390687942505
0 references
0.7443302273750305
0 references
0.7278841733932495
0 references
0.7261260747909546
0 references
