A fast algorithm for computing minimum routing cost spanning trees (Q2377885): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.comnet.2008.08.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COMNET.2008.08.013 / rank | |||
Normal rank | |||
Latest revision as of 07:15, 18 December 2024
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
