The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices |
scientific article |
Statements
The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (English)
0 references
8 November 1999
0 references
undirected graph
0 references
