Talk:Reverse-delete algorithm
Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This article is rated Start-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
It is of interest to the following WikiProjects:
WikiProject icon This article is within the scope of WikiProject Mathematics , a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Low This article has been rated as Low-priority on the project's priority scale.
WikiProject icon This article is within the scope of WikiProject Computing , a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
??? This article has not yet received a rating on the project's importance scale.
| WikiProject icon | Computer science Low‐importance | ||||||||||
| |||||||||||
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 ]