Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Talk:Reverse-delete algorithm

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 13 years ago by AustinBuchanan in topic Who is creator of reverse-delete algorithm?

Untitled

[edit]

The last graph of the example to the Reverse-delete algorithm still contains a cycle (A,B,E,F,D), therefore the algorithm will in the next (and last) step check the next largest edge EF and delete it.

Who is creator of reverse-delete algorithm?

[edit]

After reading Kruskal's 1956 paper "On the shortest spanning subtree of a graph and the traveling salesman problem", I think that his Construction A' is exactly the reverse-delete algorithm. Why is this not cited? Did someone else create it? AustinBuchanan (talk) 04:31, 29 May 2013 (UTC)Reply