Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (Q293385): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Random sampling and greedy sparsification for matroid optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4856179 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3138743 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A combinatorial bound for linear programming and related problems / rank | |||
Normal rank | |||
Latest revision as of 02:38, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees |
scientific article |
Statements
Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (English)
0 references
9 June 2016
0 references
minimum spanning trees
0 references
randomized algorithms
0 references
backwards analysis
0 references
