Skip to search form
Skip to main content
Semantic Scholar
All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
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…
(More)
Wikipedia
Watch Topic
Related topics
Related topics
12 relations
Algorithm
Borůvka's algorithm
Dijkstra's algorithm
Expected linear time MST algorithm
(More)
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
The world of computing lead people to the thinking of optimizing all the solutions, i.e. finding the best solution to a problem…
(More)
Is this relevant?
2015
2015
Multi-objective optimization of aircraft networks for weight, performance and survivability
Fabien Geyer
,
Alexandros Elefsiniotis
,
Dominic A. Schupke
,
Stefan Schneele
7th International Workshop on Reliable Networks…
2015
With a current utilization of around 25% of its total weight, optimization of cabling and harness plays an important role in the…
(More)
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE