Finding the shortest bottleneck edge in a parametric minimum spanning tree (Q2921758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding the shortest bottleneck edge in a parametric minimum spanning tree |
scientific article; zbMATH DE number 6354912
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the shortest bottleneck edge in a parametric minimum spanning tree |
scientific article; zbMATH DE number 6354912 |
Statements
13 October 2014
0 references
Finding the shortest bottleneck edge in a parametric minimum spanning tree (English)
0 references
