Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895)
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 7579633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost optimal algorithms for diameter-optimally augmenting trees |
scientific article; zbMATH DE number 7579633 |
Statements
Almost optimal algorithms for diameter-optimally augmenting trees (English)
0 references
1 September 2022
0 references
graph diameter
0 references
augmentation problem
0 references
trees
0 references
time-efficient algorithms
0 references
0 references
0 references
0.997393012046814
0 references
0.9309923648834229
0 references
0.9154626727104188
0 references
0.8926717042922974
0 references
