Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678)
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: Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs |
scientific article; zbMATH DE number 5664459
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs |
scientific article; zbMATH DE number 5664459 |
Statements
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (English)
0 references
29 January 2010
0 references
graph algorithms
0 references
building cost
0 references
multiple-source routing cost
0 references
minimum spanning tree
0 references
MST
0 references
minimum routing cost spanning tree
0 references
MRCST
0 references
0 references
