A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree (Q4636543): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree | |||
| Property / full work available at URL | |||
| Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2016/6828/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2572905496 / rank | |||
Normal rank | |||
| Property / title | |||
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree (English) | |||
| Property / title: A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree (English) / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 2024
scientific article; zbMATH DE number 6861992
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree |
scientific article; zbMATH DE number 6861992 |
Statements
19 April 2018
0 references
network augmentation
0 references
shortcuts
0 references
diameter
0 references
trees
0 references
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree (English)
0 references
