Finding the \(k\) smallest spanning trees (Q1196455): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/bit/Eppstein92, #quickstatements; #temporary_batch_1731508824982 |
||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/bit/Eppstein92 / rank | |||
Normal rank |
Latest revision as of 15:54, 13 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding the \(k\) smallest spanning trees |
scientific article |
Statements
Finding the \(k\) smallest spanning trees (English)
0 references
14 December 1992
0 references
computation of a minimum spanning tree
0 references
0 references
0 references