Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,628,423 papers from all fields of science
Search
Sign In
Create Free Account
Reverse-delete algorithm
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Algorithm
Borůvka's algorithm
Dijkstra's algorithm
Expected linear time MST algorithm
Expand
Broader (1)
Spanning tree
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
REVIEW : — Parallel Computing Approach of the Reverse-Delete Algorithm for finding Minimum Bottleneck Spanning Tree and Minimum Spanning Trees —
Ahmad Traboulsi
2015
Corpus ID: 16852947
The world of computing lead people to the thinking of optimizing all the solutions, i.e. finding the best solution to a problem…
Expand
2013
2013
An Efficient Implementation of Kruskal`s and Reverse-Delete Minimum Spanning Tree Algorithm
M. Choi
,
Sang-un Lee
2013
Corpus ID: 119933620
This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and…
Expand
2012
2012
A Reverse-Delete Algorithm for Assignment Problems
Sang-un Lee
2012
Corpus ID: 209064112
2010
2010
Reverse-delete Algorithm
Математика
2010
Corpus ID: 215968096