A fast algorithm for computing minimum routing cost spanning trees (Q2377885)
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: A fast algorithm for computing minimum routing cost spanning trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for computing minimum routing cost spanning trees |
scientific article |
Statements
A fast algorithm for computing minimum routing cost spanning trees (English)
0 references
20 January 2009
0 references
minimum routing cost tree
0 references
shortest path tree
0 references
minimum spanning tree
0 references
bridging
0 references
routing
0 references
