Finding the k most vital edges in the minimum spanning tree problem (Q1127438): 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/s0167-8191(97)00098-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042373356 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the k most vital edges in the minimum spanning tree problem |
scientific article |
Statements
Finding the k most vital edges in the minimum spanning tree problem (English)
0 references
13 August 1998
0 references
combinatorial algorithms
0 references
minimum spanning trees
0 references
most vital edges
0 references
NC algorithms
0 references
network optimization
0 references
