Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem (Q5199145): Difference between revisions
From MaRDI portal
Changed an 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.1007/978-3-642-22616-8_11 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1833577439 / rank | |||
Normal rank | |||
Latest revision as of 00:23, 20 March 2024
scientific article; zbMATH DE number 5938172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem |
scientific article; zbMATH DE number 5938172 |
Statements
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem (English)
0 references
12 August 2011
0 references
most vital edges
0 references
minimum spanning tree
0 references
exact algorithms
0 references
mixed integer program
0 references
