Jump to content

Talk:Reverse-delete algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BattyBot (talk | contribs) at 01:53, 23 July 2013 (Talk page general fixes & other cleanup using AWB (9359)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.


Untitled

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?

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]