Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544)
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 7242334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and efficiency on minimizing maximum distances in spanning trees |
scientific article; zbMATH DE number 7242334 |
Statements
Hardness and efficiency on minimizing maximum distances in spanning trees (English)
0 references
1 September 2020
0 references
3-admissibility
0 references
stretch index
0 references
graphs with few \(P_4\)s
0 references
\((k, \ell)\)-graphs
0 references
\((2, 1)\)-chordal graphs
0 references
P vs NP-complete dichotomy
0 references
0.93416464
0 references
0.92943054
0 references
0.9222294
0 references
0.9222294
0 references
0.90634036
0 references
0.90539724
0 references
0.9034534
0 references
0.9015562
0 references
0.9015562
0 references
0.8969374
0 references
