{"version":"1.0","type":"link","title":"Reverse-delete algorithm - Newikis","description":"The reverse-delete algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighted graph. It first appeared in Kruskal (1956), but it should not be confused with Kruskal's algorithm which appears in the same paper. If the graph is disconnected,…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}