Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977)
From MaRDI portal
scientific article; zbMATH DE number 1687503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) |
scientific article; zbMATH DE number 1687503 |
Statements
Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (English)
0 references
8 January 2002
0 references
combinatorial algorithms
0 references
minimum spanning trees
0 references
0 references
0 references
0 references
