Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238): 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.cor.2012.02.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092574579 / rank | |||
Normal rank | |||
Revision as of 23:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem |
scientific article |
Statements
Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (English)
0 references
15 November 2012
0 references
most vital edges
0 references
minimum spanning tree
0 references
exact algorithms
0 references
mixed integer program
0 references
