Partial inverse min-max spanning tree problem (Q830941)
From MaRDI portal
!
WARNING
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 7346753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial inverse min-max spanning tree problem |
scientific article; zbMATH DE number 7346753 |
Statements
Partial inverse min-max spanning tree problem (English)
0 references
10 May 2021
0 references
spanning trees
0 references
inverse problems
0 references
Manhattan distance
0 references
bottleneck type
0 references
0 references
0 references
0 references
0.896548330783844
0 references
0.8856611847877502
0 references
0.876677930355072
0 references
0.8765352964401245
0 references
0.8622043132781982
0 references
