An \(O(m\log n)\) algorithm for the max+sum spanning tree problem (Q1266709)
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: An \(O(m\log n)\) algorithm for the max+sum spanning tree problem |
scientific article; zbMATH DE number 1208616
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(m\log n)\) algorithm for the max+sum spanning tree problem |
scientific article; zbMATH DE number 1208616 |
Statements
An \(O(m\log n)\) algorithm for the max+sum spanning tree problem (English)
0 references
5 May 1999
0 references
max + sum spanning tree problem
0 references
0 references
