The minimum stretch spanning tree problem for typical graphs (Q2046233)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7382607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum stretch spanning tree problem for typical graphs |
scientific article; zbMATH DE number 7382607 |
Statements
The minimum stretch spanning tree problem for typical graphs (English)
0 references
17 August 2021
0 references
communication network
0 references
spanning tree optimization
0 references
tree spanner
0 references
max-stretch
0 references
congestion
0 references
0 references
0.8906936049461365
0 references
0.8807963132858276
0 references
0.8310053944587708
0 references
0.8159775733947754
0 references
0.8102907538414001
0 references
