The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices |
scientific article; zbMATH DE number 1358067
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices |
scientific article; zbMATH DE number 1358067 |
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
0.9192779
0 references
0.89711714
0 references
0.8828232
0 references
0.8801814
0 references
0.8789524
0 references
0.8774318
0 references
0.87620217
0 references
