A fast algorithm for computing minimum routing cost spanning trees (Q2377885): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.comnet.2008.08.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2123757175 / rank | |||
Normal rank | |||
Revision as of 02:48, 20 March 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
