Finding minimum congestion spanning trees (Q5463408): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/351827.384253 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120414727 / rank | |||
Normal rank | |||
Latest revision as of 03:10, 20 March 2024
scientific article; zbMATH DE number 2192042
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding minimum congestion spanning trees |
scientific article; zbMATH DE number 2192042 |
Statements
Finding minimum congestion spanning trees (English)
0 references
4 August 2005
0 references
polynomial time algorithm
0 references
